Length bounded molecular computing.

The length of DNA strands is an important resource in DNA computing. We show how to decrease strand lengths in known molecular algorithms for some NP-complete problems, such as like 3-SAT and Independent Set, without substantially increasing their running time or volume.

[1]  Bin Fu,et al.  Volume bounded molecular computation , 1997 .

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

[3]  B Fu,et al.  An O(2n) volume molecular algorithm for Hamiltonian path. , 1999, Bio Systems.

[4]  T. Head.  Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. , 1987, Bulletin of mathematical biology.

[5]  Eric Bach,et al.  DNA Models and Algorithms for NP-Complete Problems , 1998, J. Comput. Syst. Sci..

[6]  J. Sambrook,et al.  Molecular Cloning: A Laboratory Manual , 2001 .

[7]  Bin Fu,et al.  Molecular Computing, Bounded Nondeterminism, and Efficient Recursion , 1997, ICALP.

[8]  Mitsunori Ogihara,et al.  Biomolecular Computing---A Shape of Computation to Come , 1997 .

[9]  Eric B. Baum,et al.  DNA sequences useful for computation , 1996, DNA Based Computers.

[10]  Tom Head,et al.  Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors , 1987 .

[11]  Bin Fu,et al.  Molecular Computing, Bounded Nondeterminism, and Efficient Recursion , 1997, Algorithmica.

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

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

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

[15]  Erik Winfree,et al.  A sticker based model for DNA computation , 1996, DNA Based Computers.

[16]  Claus-Peter Schnorr,et al.  Optimal Algorithms for Self-Reducible Problems , 1976, ICALP.

[17]  Alan L. Selman.  Natural Self-Reducible Sets , 1988, SIAM J. Comput..

[18]  Donald Beaver.  Computing with DNA , 1995, J. Comput. Biol..

[19]  R. Tarjan.  Finding a Maximum Clique. , 1972 .

[20]  Jörg Rothe,et al.  Raising NP lower bounds to parallel NP lower bounds , 1997, SIGA.

[21]  L. Karl.  DNA computing: Arrival of biological mathematics , 1997 .

[22]  Bin Fu,et al.  On molecular approximation algorithms for NP optimization problem , 1997, DNA Based Computers.

[23]  Richard J. Lipton,et al.  On the Computational Power of DNA , 1996, Discret. Appl. Math..

[24]  Mitsunori Ogihara.  Breadth First Search 3SAT Algorithms for DNA Computers , 1996 .