On the Computational Power of DNA

Abstract We show how DNA-based computers can be used to solve the satisfiability problem for boolean circuits. Furthermore, we show how DNA computers can solve optimization problems directly without first solving several decision problems. Our methods also enable random sampling of satisfying assignments.

[1]  R J Lipton,et al.  DNA solution of hard computational problems. , 1995, Science.

[2]  Warren D. Smith.  DNA computers in vitro and vivo , 1995, DNA Based Computers.

[3]  Martyn Amos,et al.  Error-resistant implementation of DNA computations , 1996, DNA Based Computers.

[4]  Claire Mathieu,et al.  Error-resilient DNA computation , 1996, SODA '96.

[5]  John Michael Robson,et al.  Algorithms for Maximum Independent Sets , 1986, J. Algorithms.

[6]  L M Adleman,et al.  Molecular computation of solutions to combinatorial problems. , 1994, Science.

[7]  Leonard M. Adleman,et al.  On constructing a molecular computer , 1995, DNA Based Computers.

[8]  Robert E. Tarjan,et al.  Finding a Maximum Independent Set , 1976, SIAM J. Comput..

[9]  Larry J. Stockmeyer,et al.  On Approximation Algorithms for #P , 1985, SIAM J. Comput..

[10]  Richard J. Lipton,et al.  Making DNA computers error resistant , 1996, DNA Based Computers.

[11]  J.,et al.  Using DNA to Solve NP-Complete ProblemsRichard , 1995 .

[12]  Donald Beaver,et al.  A universal molecular computer , 1995, DNA Based Computers.

[13]  Richard J. Lipton,et al.  Breaking DES using a molecular computer , 1995, DNA Based Computers.

[14]  Ravi Kannan,et al.  Markov chains and polynomial time algorithms , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[15]  John H. Reif.  Parallel molecular computation , 1995, SPAA '95.

[16]  K. Wagner,et al.  On the Power of Bio-Computers , 1995 .

[17]  Paul W. K. Rothemund,et al.  A DNA and restriction enzyme implementation of Turing machines , 1995, DNA Based Computers.

[18]  Erik Winfree,et al.  On the computational power of DNA annealing and ligation , 1995, DNA Based Computers.

[19]  Eric Bach,et al.  DNA models and algorithms for NP-complete problems , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

[20]  Leslie G. Valiant,et al.  Random Generation of Combinatorial Structures from a Uniform Distribution , 1986, Theor. Comput. Sci..