Title of article
Length bounded molecular computing
Author/Authors
Fu، Bin نويسنده , , Beigel، Richard نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
-154
From page
155
To page
0
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.
Keywords
Enzyme systems , Rapid equilibrium , Transient phase , steady state , Kinetic equations , Computer program
Journal title
BioSystems
Serial Year
1999
Journal title
BioSystems
Record number
47466
Link To Document