Academies Internship Information  Sign up for PNAS Online eTocs
Link: Info for AuthorsLink: Editorial BoardLink: AboutLink: SubscribeLink: AdvertiseLink: ContactLink: Sitemap Link: PNAS Home
Proceedings of the National Academy of Sciences
Link: Current Issue "" Link: Archives "" Link: Online Submission ""  Link: Advanced Search



This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Right arrow Citation Map
Services
Right arrow Email this article to a colleague
Right arrow Companion article to this Commentary
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 File Cabinet
Right arrow Download to citation manager
Right arrow Request Copyright Permission
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via CrossRef
Right arrow Citing Articles via ISI Web of Science (20)
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Chen, J.
Right arrow Articles by Wood, D. H.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Chen, J.
Right arrow Articles by Wood, D. H.
Right arrowPubmed/NCBI databases
*Substance via MeSH
Social Bookmarking
 Add to CiteULike   Add to Complore   Add to Connotea   Add to Del.icio.us   Add to Digg  
What's this?

 Previous Article  | Table of Contents |  Next Article 

Vol. 97, Issue 4, 1328-1330, February 15, 2000

Commentary
Computation with biomolecules

Junghuei Chen*,dagger and David Harlan WoodDagger

Departments of * Chemistry & Biochemistry and Dagger  Computer & Information Sciences, University of Delaware, Newark, DE 19716


    Article

In 1994 Leonard Adleman used DNA strands to encode cities and flights to show that itineraries satisfying special conditions could be constructed and isolated in the laboratory (1). The abstract of this seminal paper concludes, "This experiment demonstrates the feasibility of computation at the molecular level." Within months Richard Lipton argued (2) that fundamental problems concerning the truth of logic statements also could be addressed in this new way. In this issue of PNAS, Faulhammer et al. (3) use laboratory techniques with relatively low error rates in an experiment realizing Lipton's earlier design.

However, within a year after Adleman's article, it already was known such approaches can require unrealistic quantities of materials, leading Stemmer (4) to suggest using existing laboratory procedures to evolve realistically sized molecular populations by inducing variation and selection. Such evolutionary computation is an established paradigm for conventional computers. Interest is beginning to focus on DNA-based implementations (5-7) of evolutionary computation because of its alleged robustness in the presence of errors and its ability to exploit the massive parallelism and memory inherent at the molecular level.

By its success in the laboratory, Adleman's work (1) sparked intense excitement and marked the birth of a new field, DNA computation. Adleman's insight was that the ability of single-stranded DNA to seek and bind to a complementary strand allows DNA to carry out massively parallel computation. Although it seems doubtful that biologically based computers will be suitable for general-purpose applications, there are some especially difficult problems where conventional computers lack the massive parallelism and huge memory capacity inherent in molecular computation. For example, the so-called "NP-complete" problems that apparently require exponentially increasing computing time with a linear increase in problem size are notoriously difficult for silicon computers to solve. . . . [Full Text of this Article]


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

Companion article to this Commentary:

From the Cover: Molecular computation: RNA solutions to chess problems
Dirk Faulhammer, Anthony R. Cukras, Richard J. Lipton, and Laura F. Landweber
PNAS 2000 97: 1385-1389. [Abstract] [Full Text]  



This article has been cited by other articles in HighWire Press-hosted journals:


Home page
Nucleic Acids ResHome page
K. A. Schmidt, C. V. Henkel, G. Rozenberg, and H. P. Spaink
DNA computing using single-molecule hybridization detection
Nucleic Acids Res., September 23, 2004; 32(17): 4962 - 4968.
[Abstract] [Full Text] [PDF]


Home page
Proc. Natl. Acad. Sci. USAHome page
J.-M. Lehn
Supramolecular Chemistry And Self-assembly Special Feature: Toward complex matter: Supramolecular chemistry and self-organization
PNAS, April 16, 2002; 99(8): 4763 - 4768.
[Full Text] [PDF]


Home page
ScienceHome page
J.-M. Lehn
Toward Self-Organization and Complex Matter
Science, March 29, 2002; 295(5564): 2400 - 2403.
[Abstract] [Full Text] [PDF]


Home page
Proc. Natl. Acad. Sci. USAHome page
J.-M. Lehn
Supramolecular Chemistry And Self-assembly Special Feature: Toward complex matter: Supramolecular chemistry and self-organization
PNAS, April 16, 2002; 99(8): 4763 - 4768.
[Full Text] [PDF]