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.
Fu
B
B
Epson Palo Alto Laboratory, Epson Research and Development, Inc., Palo Alto, CA 94304, USA. fu.bin@erd.epson.com
Beigel
R
R
D000465:Algorithms; D000818:Animals; D019295:Computational Biology; D003198:Computer Simulation; D004247:DNA / Q000032:analysis*; D006801:Humans; D008958:Models, Molecular
D004247:DNA