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