Skip to main content

Thank you for visiting You are using a browser version with limited support for CSS. To obtain the best experience, we recommend you use a more up to date browser (or turn off compatibility mode in Internet Explorer). In the meantime, to ensure continued support, we are displaying the site without styles and JavaScript.

The past, present and future of molecular computing


Ever since scientists discovered that conventional silicon-based computers have an upper limit in terms of speed, they have been searching for alternative media with which to solve computational problems. That search has led them, among other places, to DNA.

This is a preview of subscription content, access via your institution

Access options

Buy article

Get time limited or full article access on ReadCube.


All prices are NET prices.

Figure 1: An example of a seven-vertex, 13-edge graph.
Figure 2: Edge DNA forming a splint bridging two vertices.
Figure 3: Solving the Knight Problem.
Figure 4: Five correct solutions to the Knight Problem and one incorrect solution.
Figure 5: DNA computing in vivo.


  1. Adleman, L. Molecular computation of solutions to combinatorial problems. Science 266, 1021–1023 (1994).

    CAS  Article  Google Scholar 

  2. Liu, Q. et al. DNA computing on surfaces. Nature 403, 175–179 (2000).

    CAS  Article  Google Scholar 

  3. Faulhammer, D., Cukras, A., Lipton, R. J. & Landweber, L. F. Molecular computation: RNA solutions to chess problems. Proc. Natl Acad. Sci. USA 97, 1385–1389 (2000).

    CAS  Article  Google Scholar 

  4. Ouyang, Q., Kaplan, P. D., Liu, S. & Libchaber, A. DNA solution of the maximal clique problem. Science 278, 446–449 (1997).

    CAS  Article  Google Scholar 

  5. Henegariu, O., Heerema, N. A., Dlouhy, S. R., Vance, G. H. & Vogt, P. H. Multiplex PCR: Critical parameters and step-by-step protocol. Biotechniques 23, 504–511 (1997).

    CAS  Article  Google Scholar 

  6. Karp, G. Cell and Molecular Biology: Concepts and Experiments 2nd edn (John Wiley & Sons, New York, 1999).

    Google Scholar 

  7. Seife, C. RNA works out knight moves. Science 287, 1182–1183 (2000).

    CAS  Article  Google Scholar 

  8. Condon, A. & Rozenberg, G. (eds) Prelim. Proc. 6th Int. Meet. DNA Based Computers (Leiden Univ., The Netherlands, 2000).

    Google Scholar 

  9. Meller, A. et al. Rapid nanopore discrimination between single polynucleotide molecules. Proc. Natl Acad. Sci. USA 97, 1079–1084 (2000).

    CAS  Article  Google Scholar 

  10. Sakamoto, K. et al. Molecular computation by DNA hairpin formation. Science 288, 1223–1226 (2000).

    CAS  Article  Google Scholar 

  11. Seeman, N. C. DNA engineering and its application to biotechnology. Trends Biotechnol. 17, 437–443 (2000).

    Article  Google Scholar 

  12. Winfree, E. et al. in DNA Based Computers II. DIMACS Series in Discrete Mathematics and Theoretical Computer Science Vol. 44 (eds Landweber, L. F. & Baum, E. B.) (American Mathematical Soc., Providence, Rhode Island, 1999).

    Google Scholar 

  13. Winfree, E., Liu, F., Wenzler, L. A. & Seeman, N. C. Design and self-assembly of two-dimensional DNA crystals. Nature 394, 539–544 (1998).

    CAS  Article  Google Scholar 

  14. Landweber, L. F., Kuo, T.-C. & Curtis, E. A. Evolution and assembly of an extremely scrambled gene. Proc. Natl Acad. Sci. USA 97, 3298–3303 (2000).

    CAS  Article  Google Scholar 

Download references

Author information

Authors and Affiliations


Related links

Related links


DNA computing: a primer

Laura Landweber's homepage

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Ruben, A., Landweber, L. The past, present and future of molecular computing. Nat Rev Mol Cell Biol 1, 69–72 (2000).

Download citation

  • Issue Date:

  • DOI:

This article is cited by


Quick links

Nature Briefing

Sign up for the Nature Briefing newsletter — what matters in science, free to your inbox daily.

Get the most important science stories of the day, free in your inbox. Sign up for Nature Briefing