DNA Models and Algorithms for NP-Complete Problems

29Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A goal of research on DNA computing is to solve problems that are beyond the capabilities of the fastest silicon-based supercomputers. Adleman and Lipton present exhaustive search algorithms for 3Sat and 3-coloring, which can only be run on small instances and, hence, are not practical. In this paper, we show how improved algorithms can be developed for the 3-coloring and independent set problems. Our algorithms use only the DNA operations proposed by Adleman and Lipton, but combine them in more powerful ways and use polynomial preprocessing on a standard computer to tailor them to the specific instance to be solved. The main contribution of this paper is a more general model of DNA algorithms than that proposed by Lipton. We show that DNA computation for NP-complete problems can do more than just exhaustive search. Further research in this direction will help determine whether or not DNA computing is viable for NP-hard problems. A second contribution is the first analysis of errors that arise in generating the solution space for DNA computation. © 1998 Academic Press.

Cite

CITATION STYLE

APA

Bach, E., Condon, A., Glaser, E., & Tanguay, C. (1998). DNA Models and Algorithms for NP-Complete Problems. Journal of Computer and System Sciences, 57(2), 172–186. https://doi.org/10.1006/jcss.1998.1586

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free