1Department of Chemistry, University of Wisconsin, Madison 53706, USA.
You might also read
Articles linked to this work by shared authors, journal, and citation graph.
DNA computing offers a novel approach to solving complex computational problems. This study demonstrates its application to the satisfiability problem (SAT), a type of NP-complete problem.
Area of Science:
Background:
Purpose of the Study:
Main Methods:
Main Results:
Conclusions: