Encyclopedia of Complexity and Systems Science

Living Edition
| Editors: Robert A. Meyers

DNA Computing

  • Martyn Amos
Living reference work entry
DOI: https://doi.org/10.1007/978-3-642-27737-5_131-3

Definition of the Subject

DNA computing (or, more generally, biomolecular computing) is a relatively new field of study that is concerned with the use of biological molecules as fundamental components of computing devices. It draws on concepts and expertise from fields as diverse as chemistry, computer science, molecular biology, physics, and mathematics. Although its theoretical history dates back to the late 1950s, the notion of computing with molecules was only physically realized in 1994, when Leonard Adleman demonstrated in the laboratory the solution of a small instance of a well-known problem in combinatorics using standard tools of molecular biology. Since this initial experiment, interest in DNA computing has increased dramatically, and it is now a well-established area of research. As we expand our understanding of how biological and chemical systems process information, opportunities arise for new applications of molecular devices in bioinformatics, nanotechnology,...

Keywords

Central Processing Unit Maximal Clique Hamiltonian Path Truth Assignment Large Clique 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Bibliography

Primary Literature

  1. Adleman LM (1994) Molecular computation of solutions to combinatorial problems. Science 266:1021–1024CrossRefADSGoogle Scholar
  2. Adleman LM (1995) On constructing a molecular computer. University of Southern California, Los Angeles, DraftGoogle Scholar
  3. Amos M (2005) Theoretical and experimental DNA computation. Springer, BerlinzbMATHGoogle Scholar
  4. Amos M, Gibbons A, Hodgson D (1996) Error-resistant implementation of DNA computations. In: Landweber LF, Baum EB (eds) 2nd annual workshop on DNA based computers. Princeton University, NJ, 10-12 June 1996. American Mathematical Society, ProvidenceGoogle Scholar
  5. Arkin A, Ross J (1994) Computational functions in biochemical reaction networks. Biophys J 67:560–578CrossRefGoogle Scholar
  6. Benenson Y, Paz-Elizur T, Adar R, Keinan E, Livneh Z, Shapiro E (2001) Programmable and autonomous computing machine made of biomolecules. Nature 414:430–434CrossRefADSGoogle Scholar
  7. Benenson Y, Adam R, Paz-Livneh T, Shapiro E (2003) DNA molecule provides a computing machine with both data and fuel. Proc Natl Acad Sci USA 100:2191–2196CrossRefADSGoogle Scholar
  8. Bennett CH (1982) The thermodynamics of computation – a review. Int J Theor Phys 21:905–940CrossRefGoogle Scholar
  9. Braich RS, Chelyapov N, Johnson C, Rothemund PWK, Adleman L (2002) Solution of a 20-variable 3-SAT problem on a DNA computer. Science 296:499–502CrossRefADSGoogle Scholar
  10. Bray D (1995) Protein molecules as computational elements in living cells. Nature 376:307–312CrossRefADSGoogle Scholar
  11. Breslauer KJ, Frank R, Blocker H, Marky LA (1986) Predicting DNA duplex stability from the base sequence. Proc Natl Acad Sci USA 83(11):3746–3750CrossRefADSGoogle Scholar
  12. Brown TA (1993) Genetics: a molecular approach. Chapman and Hall, New YorkGoogle Scholar
  13. Campbell-Kelly M, Aspray W (2004) Computer: a history of the information machine, 2nd edn. Westview Press, ColoradoGoogle Scholar
  14. Conrad M (1985) On design principles for a molecular computer. Commun ACM 28:464–480CrossRefGoogle Scholar
  15. Conrad M, Liberman EA (1982) Molecular computing as a link between biological and physical theory. J Theor Biol 98:239–252CrossRefGoogle Scholar
  16. Cook S (1971) The complexity of theorem proving procedures. Proceedings of the 3rd annual ACM symposium on theory of computing, pp 151–158Google Scholar
  17. Faulhammer D, Cukras AR, Lipton RJ, Landweber LF (2000) Molecular computation: RNA solutions to chess problems. Proc Natl Acad Sci USA 97:1385–1389CrossRefADSGoogle Scholar
  18. Feynman RP (1961) There’s plenty of room at the bottom. In: Gilbert D (ed) Miniaturization. Reinhold, New York, pp 282–296Google Scholar
  19. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. WH Freeman and Company, New YorkzbMATHGoogle Scholar
  20. Gibbons AM (1985) Algorithmic graph theory. Cambridge University Press, CambridgezbMATHGoogle Scholar
  21. Guarnieri F, Fliss M, Bancroft C (1996) Making DNA add. Science 273:220–223CrossRefADSGoogle Scholar
  22. Hartmanis J (1995) On the weight of computations. Bull Eur Assoc Theor Comput Sci 55:136–138zbMATHGoogle Scholar
  23. Hjelmfelt A, Weinberger ED, Ross J (1991) Chemical implementation of neural networks and turing machines. Proc Natl Acad Sci USA 88:10983–10987CrossRefzbMATHADSGoogle Scholar
  24. Hjelmfelt A, Schneider FW, Ross J (1993) Pattern recognition in coupled chemical kinetic systems. Science 260:335–337CrossRefADSGoogle Scholar
  25. Lipton RJ (1995) DNA solution of hard computational problems. Science 268:542–545CrossRefADSGoogle Scholar
  26. Liu Q, Wang L, Frutos AG, Condon AE, Corn RM, Smith LM (2000) DNA computing on surfaces. Nature 403:175–179CrossRefADSGoogle Scholar
  27. Mao C, LaBean TH, Reif JH, Seeman NC (2000) Logical computation using algorithmic self-assembly of DNA triple-crossover molecules. Nature 407:493–496CrossRefADSGoogle Scholar
  28. Mullis KB, Ferré F, Gibbs RA (eds) (1994) The polymerase chain reaction. Birkhauser, BostonGoogle Scholar
  29. Ogihara M, Ray A (2000) DNA computing on a chip. Nature 403:143–144CrossRefADSGoogle Scholar
  30. Ouyang Q, Kaplan PD, Liu S, Libchaber A (1997) DNA solution of the maximal clique problem. Science 278:446–449CrossRefADSGoogle Scholar
  31. Regalado A (2002) DNA computing. MIT Technology Review. http://www.technologyreview.com/articles/00/05/regalado0500.asp. Accessed 26 May 2008
  32. Rivest R, Shamir A, Adleman L (1978) A method for obtaining digital signatures and public key cryptosystems. Comm ACM 21:120–126CrossRefzbMATHMathSciNetGoogle Scholar
  33. Rothemund PWK (2006) Folding DNA to create nanoscale patterns. Nature 440:297–302CrossRefADSGoogle Scholar
  34. Roweis S, Winfree E, Burgoyne R, Chelyapov NV, Goodman MF, Rothemund PWK, Adleman LM (1996) A sticker based architecture for DNA computation. In: Landweber LF, Baum EB (eds) 2nd annual workshop on DNA based computers. Princeton University, NJ, 10-12 June 1996. American Mathematical Society, ProvidenceGoogle Scholar
  35. Sakamoto K, Gouzu H, Komiya K, Kiga D, Yokoyama S, Yokomori T, Hagiya M (2000) Molecular computation by DNA hairpin formation. Science 288:1223–1226CrossRefADSGoogle Scholar
  36. Smalley E (2005) Interview with Ned Seeman. Technology Research News, May 4Google Scholar
  37. Smith LM (2006) Nanostructures: the manifold faces of DNA. Nature 440:283–284CrossRefADSGoogle Scholar
  38. Stubbe H (1972) History of genetics – from prehistoric times to the rediscovery of Mendel’s laws. MIT Press, CambridgeGoogle Scholar
  39. van Noort D, Gast F-U, McCaskill JS (2002) DNA computing in microreactors. In: Jonoska N, Seeman NC (eds) DNA computing: 7th international workshop on DNA-based computers, vol 2340, LNCS. Springer, Berlin, pp 33–45CrossRefGoogle Scholar
  40. Watkins JJ (2004) Across the board: the mathematics of chess problems. Princeton University Press, PrincetonGoogle Scholar
  41. Watson JD, Crick FHC (1953a) Genetical implications of the structure of deoxyribose nucleic acid. Nature 171:964CrossRefADSGoogle Scholar
  42. Watson JD, Crick FHC (1953b) Molecular structure of nucleic acids: a structure for deoxyribose nucleic acid. Nature 171:737–738CrossRefADSGoogle Scholar
  43. Watson JD, Hopkins NH, Roberts JW, Steitz JA, Weiner AM (1987) Molecular biology of the gene, 4th edn. Benjamin/Cummings, Menlo ParkGoogle Scholar
  44. Winfree E (1998) Algorithmic self-assembly of DNA. PhD thesis, California Institute of TechnologyGoogle Scholar
  45. Winfree E, Liu F, Wenzler L, Seeman NC (1998) Design and self-assembly of two-dimensional DNA crystals. Nature 394:539–544CrossRefADSGoogle Scholar
  46. Yan H, Park SH, Finkelstein G, Reif JH, LaBean TH (2003) DNA-templated self-assembly of protein arrays and highly conductive nanowires. Science 301:1882–1884CrossRefADSGoogle Scholar

Books and Reviews

  1. Adleman L (1998) Computing with DNA. Sci Am 279:54–61CrossRefGoogle Scholar
  2. Amos M (2006) Genesis machines: the new science of biocomputing. Atlantic Books, LondonGoogle Scholar
  3. Forbes N (2004) Imitation of life: how biology is inspiring computing. MIT Press, CambridgeGoogle Scholar
  4. Gonick L, Wheelis M (1983) The cartoon guide to genetics. Harper Perennial, New YorkGoogle Scholar
  5. Jones R (2004) Soft machines: nanotechnology and life. Oxford University Press, OxfordGoogle Scholar
  6. Păun G, Rozenberg G, Salomaa A (1998) DNA computing: new computing paradigms. Springer, BerlinCrossRefzbMATHGoogle Scholar
  7. Pool R (1995) A boom in plans for DNA computing. Science 268:498–499CrossRefADSGoogle Scholar
  8. Watson J (2004) DNA: the secret of life. Arrow Books, LondonGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.Department of Computing and MathematicsManchester Metropolitan UniversityManchesterUK