## Molecular solutions for minimum and exact cover problems in the tile assembly model

- Xu Zhou, Yantao Zhou, Keqin Li, Ahmed Sallam, Keqin Li
- The Journal of Supercomputing
- 2014

Highly Influenced

@article{Chang2003SolvingTS, title={Solving the set cover problem and the problem of exact cover by 3-sets in the Adleman-Lipton model.}, author={Weng Long Chang and Minyi Guo}, journal={Bio Systems}, year={2003}, volume={72 3}, pages={263-75} }

- Published 2003 in Bio Systems

Adleman wrote the first paper in which it is shown that deoxyribonucleic acid (DNA) strands could be employed towards calculating solutions to an instance of the NP-complete Hamiltonian path problem (HPP). Lipton also demonstrated that Adleman's techniques could be used to solve the NP-complete satisfiability (SAT) problem (the first NP-complete problem). In this paper, it is proved how the DNA operations presented by Adleman and Lipton can be used for developing DNA algorithms to resolving theâ€¦Â CONTINUE READING