If you need an accessible version of this item please contact JSTOR User Support

Molecular Computation of Solutions to Combinatorial Problems

Leonard M. Adleman
Science
New Series, Vol. 266, No. 5187 (Nov. 11, 1994), pp. 1021-1024
Stable URL: http://www.jstor.org/stable/2885489
Page Count: 4
  • Download PDF
  • Cite this Item

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support
Molecular Computation of Solutions to Combinatorial Problems
Preview not available

Abstract

The tools of molecular biology were used to solve an instance of the directed Hamiltonian path problem. A small graph was encoded in molecules of DNA, and the "operations" of the computation were performed with standard protocols and enzymes. This experiment demonstrates the feasibility of carrying out computations at the molecular level.

Page Thumbnails

  • Thumbnail: Page 
1021
    1021
  • Thumbnail: Page 
1022
    1022
  • Thumbnail: Page 
1023
    1023
  • Thumbnail: Page 
1024
    1024