corner
corner
APS » Journals » Phys. Rev. Lett. » Volume 80 » Issue 2
< Previous Article | Next Article >

Phys. Rev. Lett. 80, 417–420 (1998)

Reliability and Efficiency of a DNA-Based Computation

Download: PDF (94 kB) Buy this article Export: BibTeX or EndNote (RIS)

R. Deaton1,*, M. Garzon2,†, R. C. Murphy3, J. A. Rose1, D. R. Franceschetti4, and S. E. Stevens, Jr.3
1The Department of Electrical Engineering, The University of Memphis, Memphis, Tennessee 38152
2The Department of Computer Science, The University of Memphis, Memphis, Tennessee 38152
3The Department of Microbiology and Molecular Cell Sciences, The University of Memphis, Memphis, Tennessee 38152
4The Department of Physics, The University of Memphis, Memphis, Tennessee 38152

Received 10 October 1996; published in the issue dated 12 January 1998

DNA-based computing uses the tendency of nucleotide bases to bind (hybridize) in preferred combinations to do computation. Depending on reaction conditions, oligonucleotides can bind despite noncomplementary base pairs. These mismatched hybridizations are a source of false positives and negatives, which limit the efficiency and scalability of DNA-based computing. The ability of specific base sequences to support error-tolerant Adleman-style computation is analyzed, and criteria are proposed to increase reliability and efficiency. A method is given to calculate reaction conditions from estimates of DNA melting.

© 1998 The American Physical Society

URL:
http://link.aps.org/doi/10.1103/PhysRevLett.80.417
DOI:
10.1103/PhysRevLett.80.417
PACS:
89.70.+c, 87.15.By, 89.80.+h

*Electronic address: rjdeaton@memphis.edu

†Electronic address: mgarzon@memphis.edu

 
< Previous Article | Next Article >