A general resolution of intractable problems in polynomial time through DNA Computing

C.A.A Sanches,N.Y Soma

doi:10.1016/j.biosystems.2016.09.008

A general resolution of intractable problems in polynomial time through DNA Computing

C.A.A Sanches, N.Y Soma

https://doi.org/10.1016/j.biosystems.2016.09.008

Copy DOI

Journal: Biosystems	Publication Date: Sep 28, 2016
Citations: 8

Affiliation: Instituto Tecnológico de Aeronáutica

#Problems In Polynomial Time #Matrix Bandwidth Minimization Problem + Show 8 more

Abstract
Full-Text PDF
Similar Papers

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.

Full Text