| Full text | |
| Author(s): |
Sanches, C. A. A.
;
Soma, N. Y.
Total Authors: 2
|
| Document type: | Journal article |
| Source: | BIOSYSTEMS; v. 150, p. 119-131, DEC 2016. |
| Web of Science Citations: | 4 |
| Abstract | |
Based on a set of known biological operations, a general resolution of intractable problems in polynomial time through DNA Computing is presented. This scheme has been applied to solve two NP-Hard problems (Minimization of Open Stacks Problem and Matrix Bandwidth Minimization Problem) and three co-NP-Complete problems (associated with Hamiltonian Path, Traveling Salesman and Hamiltonian Circuit), which have not been solved with this model. Conclusions and open questions concerning the computational capacity of this model are presented, and research topics are suggested. (C) 2016 Elsevier Ireland Ltd. All rights reserved. (AU) | |
| FAPESP's process: | 15/18164-5 - Parallel solutions to intractable problems in industrial processes |
| Grantee: | Carlos Alberto Alonso Sanches |
| Support Opportunities: | Regular Research Grants |