Skip Navigation

This Article
Right arrow Full Text Freely available
Right arrow Print PDF (341K) Freely available
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (8)
Right arrow Commercial Re-use Guidelines
for Open Access NAR Content
Google Scholar
Right arrow Articles by Su, X.
Right arrow Articles by Smith, L. M.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Su, X.
Right arrow Articles by Smith, L. M.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Published online 4 June 2004

Nucleic Acids Research, 2004, Vol. 32, No. 10 3115-3123
© 2004 Oxford University Press

Demonstration of a universal surface DNA computer

Xingping Su and Lloyd M. Smith*

Department of Chemistry, University of Wisconsin–Madison, 1101 University Avenue, Madison, WI 53706, USA

*To whom correspondence should be addressed. Tel: +1 608 263 2594; Fax: +1 608 265 6780; Email: smith{at}chem.wisc.edu

Received April 19, 2004; Accepted May 13, 2004

A fundamental concept in computer science is that of the universal Turing machine, which is an abstract definition of a general purpose computer. A general purpose (universal) computer is defined as one which can compute anything that is computable. It has been shown that any computer which is able to simulate Boolean logic circuits of any complexity is such a general purpose computer. The field of DNA computing was founded in 1994 by Adleman’s solution of a 7-bit instance of the Hamiltonian path problem. This work, as well as most of the subsequent experimental and theoretical investigations in the area, focused primarily upon the solution of NP-complete problems, which are a subset of the larger universal class of problems. In the present work a surface DNA computer capable of simulating Boolean logic circuits is demonstrated. This was done by constructing NOR and OR gates and combining them into a simple logic circuit. The NOR gate is one of the universal gates in Boolean logic, meaning that any other logic gate can be built from it alone. The circuit was solved using DNA-based operations, demonstrating the universal nature of this surface DNA computing model.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 Nucleic Acids ResHome page
S. Beyer and F. C. Simmel
A modular DNA signal translator for the controlled release of a protein by an aptamer
Nucleic Acids Res., March 17, 2006; 34(5): 1581 - 1587.
[Abstract] [Full Text] [PDF]

Home page
 RadiologyHome page
A. B. Wolbarst and W. R. Hendee
Evolving and Experimental Technologies in Medical Imaging
Radiology, January 1, 2006; 238(1): 16 - 39.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
M. R. Shortreed, S. B. Chang, D. Hong, M. Phillips, B. Campion, D. C. Tulpan, M. Andronescu, A. Condon, H. H. Hoos, and L. M. Smith
A thermodynamic approach to designing structure-free combinatorial DNA word sets
Nucleic Acids Res., September 2, 2005; 33(15): 4965 - 4977.
[Abstract] [Full Text] [PDF]


Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.