Skip to main content
SpringerLink
Log in

Molecular Computing Machineries — Computing Models and Wet Implementations

  • Reference work entry
Book cover Handbook of Natural Computing

Abstract

This chapter presents both the theoretical results of molecular computing models mainly from the viewpoint of computing theory and the biochemical implementations of those models in wet lab experiments. Selected topics include a variety of molecular computing models with computabilities ranging from finite automata to Turing machines, and the associated issues of molecular implementation, as well as some applications to logical controls for circuits and medicines.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 999.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,199.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Adleman L (1994) Molecular computation of solutions to combinatorial problems. Science 266:1021–1024

    Article  Google Scholar 

  • Adleman L (1996) On constructing a molecular computer. DNA based computers. Series in mathematics and theoretical computer science, vol 27. American Mathematical Society, Providence, RI, pp 1–22

    Google Scholar 

  • Amos M, Dunne PE, Gibbons A (1998) DNA simulation of Boolean circuits. In: Koza et al. (eds) Proceedings of the third annual conference on genetic programming, University of Wisconsin, Madison, WI, July 1998. Morgan Kaufmann, San Francisco, CA, pp 679–683

    Google Scholar 

  • Arita M, Hagiya M, Suyama A (1997) Joining and rotating data with molecules. In: IEEE international conference on evolutionary computation, Indianapolis, IN, June 1996, IEEE Service Center, pp 243–248

    Google Scholar 

  • Bath J, Turberfield JA (2007) DNA nanomachines. Nat Nanotechnol 2:275–284

    Article  Google Scholar 

  • Beaver D (1995) A universal molecular computer. In: Lipton J, Baum B (eds) DNA based computers. DIMACS series in discrete mathematics and theoretical computer science, vol 27. American Mathematics Society, Providence, RI, pp 29–36

    Google Scholar 

  • Benenson Y, Adar R, Paz-Elizur T, Livneh Z, Shapiro E (2003) DNA molecule provides a computing machine with both data and fuel. Proc Natl Acad Sci USA 100(5):2191–2196

    Article  Google Scholar 

  • Benenson Y, Gil B, Ben-Dor U, Adar R, Shapiro E (2004) An autonomous molecular computer for logical control of gene expression. Nature 429: 423–429

    Article  Google Scholar 

  • 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–434

    Article  Google Scholar 

  • Brauer W, Ehrig H, Karhumäki J, Salomaa A (eds) (2002) Formal and natural computing. Lecture notes in computer science, vol 2300. Springer, Berlin

    MATH  Google Scholar 

  • Brendel V, Busse HG (1984) Genome structure described by formal languages. Nucl Acids Res 12:2561–2568

    Article  Google Scholar 

  • Cheptea D, Martin-Vide C, Mitrana V (2006) A new operation on words suggested by DNA biochemistry: hairpin completion. In: Proceedings of transgressive computing, Universidad de Granada, Spain, April 2006, 216–228

    Google Scholar 

  • Condon A (2004) Automata make antisense. Nature 429:351–352

    Article  Google Scholar 

  • Conrad M (1985) On design principles for a molecular computer. Comm ACM 28(5):464–480

    Article  Google Scholar 

  • Conrad M (1992) Molecular computing paradigms. IEEE Comput 25(11):6–9

    Google Scholar 

  • Csuhaj-Varju E, Kari L, Păun Gh (1996) Test tube distributed systems based on splicing. Comput AI 15:211–232

    MATH  Google Scholar 

  • Csuhaj-Varju E, Verlan S (2008) On length-separating test tube systems. Nat Comput 7:167–181

    Article  MathSciNet  MATH  Google Scholar 

  • Dassow J, Păun Gh (1989) Regulated rewriting in formal language theory. Springer, Berlin

    Book  Google Scholar 

  • Doramatzki M (2006) Hairpin structures defined by DNA trajectories. In: DNA 12: Proceedings of 12th international meeting on DNA computing, Seoul, Korea, June 2006. Lecture notes in computer science, vol 4287. Springer, Berlin, pp 182–194

    Google Scholar 

  • Eberling W, Jimenez-Montano MA (1980) On grammars, complexity and information measures of biological macromolecules. Math Biosci 52:53–72

    Article  Google Scholar 

  • Endy D (2005) Foundations for engineering biology. Nature 438:449–453: (vol 438 – 24 November 2005 – doi:10.1038/nature04342.)

    Article  Google Scholar 

  • Eng T (1997) Linear DNA self-assembly with hairpins generates the equivalent of linear context-free grammars. DNA based computers III. DIMACS series in discrete mathematics and theoretical computer science, vol 48. American Mathematical Society, Providence, RI, pp 289–296

    MathSciNet  Google Scholar 

  • Engelfriet J, Rozenberg G (1980) Fixed point languages, equality languages, and representation of recursively enumerable languages. J ACM, 27(3):499–518

    Article  MathSciNet  MATH  Google Scholar 

  • Freund R, Kari L, Păun Gh (1999a) DNA computing based on splicing: the existence of universal computers. Technical report, Fachgruppe Informatik, Tech. Univ. Wien, 1995, and Theory Comput Syst 32:69–112

    MATH  Google Scholar 

  • Freund R, Păun Gh, Rozenberg G, Salomaa A (1999b) Watson-Crick finite automata. DNA based computers III. DIMACS series in discrete mathematics and theoretical computer science, vol 48. American Mathematical Society, Providence, RI, pp 297–327

    Google Scholar 

  • Gao Y, Garzon M, Murphy RC, Rose JA, Deaton R, Franceschetti DR, Stevens SE Jr (1999) DNA implementation of nondeterminism. DNA based computers III. DIMACS series in discrete mathematics and theoretical computer science, vol 48. American Mathematical Society, Providence, RI, pp 137–148

    Google Scholar 

  • Geffert V (1991) Normal forms for phrase-structure grammars. RAIRO Theor Inform Appl 25:473–496

    MathSciNet  MATH  Google Scholar 

  • Hagiya M (1999) Perspectives on molecular computing. New Generation Comput 17:131–151

    Article  Google Scholar 

  • Hagiya M (2001) From molecular computing to molecular programming. In: DNA6: Proceedings of sixth international meeting on DNA based computers, Leiden, the Netherlands, June 2000. Lecture notes in computer science, vol 2054. Springer, Berlin, pp 89–102

    Google Scholar 

  • Hagiya M, Arita M, Kiga D, Sakamoto K, Yokoyama S (2000) Towards parallel evaluation and learning of Boolean μ-formulas with molecules. In: Rubin H, Wood D (eds). DNA based computers III, DIMACS series in discrete mathematics, vol 48. American Mathematical Society, Providence, RI, pp 57–72

    Google Scholar 

  • Hagiya M, Ohuchi A (2002) Preliminary proceedings of the eighth international meeting on DNA based computers, Hokkaido University, Hokkaido, Japan, June 10–13, 2002

    Google Scholar 

  • Head T (1987) Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. Bull Math Biol 49:737–759

    MathSciNet  MATH  Google Scholar 

  • Head T, Păun Gh, Pixton D (1997) Language theory and molecular genetics. Generative mechanisms suggested by DNA recombination In: Rozenberg G, Salomaa A (eds) Handbook of formal languages, vol 2. Springer, Berlin, pp 295–360

    Google Scholar 

  • Hopcroft JE, Motwani R, Ullman JD (2001) Introduction to automata theory, languages, and computation, 2nd edn. Addison-Wesley, Reading, MA

    Google Scholar 

  • Horn A (1951) On sentences which are true of direct unions of algebras. J Symbolic Logic 16:14–21

    Article  MathSciNet  MATH  Google Scholar 

  • Ignatove Z, Martinez-Perez I, Zimmermann K-H (2008) DNA Computing Models. Springer, New York

    Google Scholar 

  • Jimenez-Montano MA (1984) On the syntactic structure of protein sequences and the concept of grammar complexity, Bull Math Biol 46:641–659

    Article  MathSciNet  MATH  Google Scholar 

  • Jonoska N, Karl SA, Saito M (1998) Three dimensional DNA structures in computing. In: Kari L (ed) Proceedings of 4th DIMACS meeting on DNA based computers, University of Pennsylvania, Philadelphia, PA, June 16–19, 1998, American Mathematics Society, pp 189–200

    Google Scholar 

  • Jonoska N, McColm GL (2009) Complexity classes for self-assembling flexible tiles. Theor Comput Sci 410:332–346

    Article  MathSciNet  MATH  Google Scholar 

  • Joshi AK, Schabes Y (1997) Tree-adjoining grammars. In Rozenberg G, Salomaa A (eds) Handbook of formal languages, vol. 3. Springer, Berlin, pp 69–123

    Chapter  Google Scholar 

  • Kari L (1996) DNA computers: tomorrow's reality. Tutorial Bull EATCS 59:256–266

    Google Scholar 

  • Kari L, Konstantinidis S, Losseva E, Sosik P, Thierrin G (2005a) Hairpin structures in DNA words. In: DNA11: Proceedings of the 11th international meeting on DNA computing, London, ON, Canada, June 2005, Lecture notes in computer science, vol 3892. Springer, Berlin, pp 267–277

    Google Scholar 

  • Kari L, Konstantinidis S, Sosik P, Thierrin G (2005b) On hairpin-free words and languages. In: deFelice C, Restivo A (eds) Proceedings of the 9th international conference on developments in language theory, Palermo, Italy, July 2005. Lecture notes in computer science, vol 3572. Springer, Berlin, pp 296–307

    Google Scholar 

  • Kari L, Rozenberg G (2008) The many facets of natural computing, C. ACM: 51(10):72–83

    Article  Google Scholar 

  • Kari L, Konstantinidis S, Sosik P (2005c) On properties of bond-free DNA languages, Theor Comput Sci. 334:131–159

    Article  MathSciNet  MATH  Google Scholar 

  • Kobayashi S (1999) Horn clause computation with DNA molecules. J Combinatorial Optimization 3:277–299

    Article  MATH  Google Scholar 

  • Kobayashi S, Mitrana V, Păun G, Rozenberg G (2001) Formal properties of PA-matching. Theor Comput Sci 262:117–131

    Article  MATH  Google Scholar 

  • Kobayashi S, Sakakibara Y (1998) Multiple splicing systems and the universal computability. Theor Comput Sci 264:3–23

    Article  MathSciNet  Google Scholar 

  • Kobayashi S, Yokomori T, Sanpei G, Mizobuchi K (1997) DNA implementation of simple Horn clause computation. In: IEEE international conference on evolutionary computation, Indianapolis, IN, April 1997, IEEE Service Center, pp 213–217

    Google Scholar 

  • Komiya K, Rose JA (2009) Experimental validation of signal dependent operation in Whiplash PCR. In: Goel A, Simmel FC (eds) DNA computing. 14th international workshop on DNA-based computers, Prague, Czech Republic, June 2008. Lecture notes in computer science, vol 5347, pp 1–10

    Google Scholar 

  • Komiya K, Sakamoto K, Gouzu H, Yokohama S, Arita M, Nishikawa A, Hagiya M (2001) Successive state transitions with I/O interface by molecules. In: Condon A, Rozenberg G (eds) DNA computing. 6th international workshop on DNA-based computers, Leiden, the Netherlands, June 2000. Lecture notes in computer science, vol 2054, pp 17–26

    Google Scholar 

  • Komiya K, Sakamoto K, Kameda A, Yamamoto M, Ohuchi A, Kiga D, Yokoyama S, Hagiya M (2006) DNA polymerase programmed with a hairpin DNA incorporates a multiple-instruction architecture into molecular computing. Biosystems 83:18–25

    Article  Google Scholar 

  • Kuramochi J, Sakakibara Y (2005) Intensive in vitro experiments of implementing and executing finite automata in test tube. In: DNA11: Proceedings of 11th international workshop on DNA computers, London, Canada, June 2005. Lecture notes in computer science, vol 3892, pp 193–202

    Google Scholar 

  • LaBean TH, Winfree E, Reif JH (2000) Experimental progress in computation by self-assembly of DNA tilings. In: Winfree E, Gifford DK (eds) DNA based computers V. DIMACS series in discrete mathematics and theoretical computer science, vol 54. American Mathematical Society, Providence, RI, pp 123–140

    Google Scholar 

  • Lagoudakis MG, LaBean TH (2000) 2D DNA self-assembly for satisfiability. In: Winfree E, Gifford DK (eds) DNA based computers V. DIMACS series in discrete mathematics and theoretical computer science, vol 54. American Mathematical Society, Providence, RI, pp 141–154

    Google Scholar 

  • Laun E, Reddy K (1997) Wet splicing systems. In: Proceedings of 3rd DIMACS meeting on DNA based computers, University of Pennsylvania, Philadelphia, PA, June 23–25, 1997, pp 115–126

    Google Scholar 

  • Lipton RJ (1995) DNA solution of hard computational problems. Science 268:542–545

    Article  Google Scholar 

  • Lipton RJ, Baum EB (eds) (1996) DNA based computers. Series in mathematics and theoretical computer science, vol 27. American Mathematical Society, Providance, RI

    MATH  Google Scholar 

  • Manea F, Mitrana V (2007) Hairpin completion versus hairpin reduction. In: Computation in Europe, CiE 2007, Siena, Italy, June 2007. Lecture notes in computer science, vol 4497. Springer, Berlin, pp 532–541

    Google Scholar 

  • Manea F, Mitrana V, Yokomori T (2008) Some remarks on the hairpin completion. In: Proceedings of 12th international conference on AFL, Hungary, May 2008. (to appear in Int J Found Comput Sci)

    Google Scholar 

  • Manea F, Mitrana V, Yokomori T (2009a) Two complementary operations inspired by the DNA hairpin formation: completion and reduction. Theor Comput Sci 410:417–425

    Article  MathSciNet  Google Scholar 

  • Manea F, Martín-Vide C, Mitrana V (2009b) On some algorithmic problems regarding the hairpin completion. Discrete Appl Math 157:2143–2152

    Article  MathSciNet  MATH  Google Scholar 

  • Mao C, LaBean TH, Relf JH, Seeman NC (Sep 2000) Logical computation using algorithmic self-assembly of DNA triple-crossover molecules. Nature 407(6803):493–496, Sep 2000

    Article  Google Scholar 

  • Marcus S (1969) Contextual grammars. Revue Roum Math Pures Appl 14(10):473–1482

    Google Scholar 

  • Nitta N, Suyama A (2004) Autonomous biomolecular computer modeled after retroviral replication. In: Chen J, Reif J (eds) DNA9: Proceedings of 9th international meeting on DNA-based computers, Madison, WI, June 2003. Lecture notes in computer science, vol 2943, pp 203–212

    Google Scholar 

  • Ogihara M, Ray A (1999) Simulating Boolean circuits on a DNA computer. Algorithmica 25:239–250

    Article  MathSciNet  MATH  Google Scholar 

  • Păun Gh (1996a) Five (plus two) universal DNA computing models based on the splicing operation. In: Proceedings of 2nd DIMACS workshop on DNA based computers, Princeton, NJ, June 1996, pp 67–86

    Google Scholar 

  • Păun Gh (1996b) Regular extended H systems are computationally universal. J Automata, Lang Combinatorics 1(1):27–36

    MATH  Google Scholar 

  • Păun Gh (1999) (DNA) Computing by carving. Soft Comput 3(1):30–36

    Article  Google Scholar 

  • Păun Gh, Rozenberg G, Salomaa A (1998) DNA computing: new computing paradigms. Springer, Berlin

    MATH  Google Scholar 

  • Păun Gh, Rozenberg G, Yokomori T (2001) Hairpin languages. Int J Found Comput Sci 12(6):837–847

    Article  Google Scholar 

  • Pixton D (1995) Linear and circular splicing systems. In: Proceedings of 1st international symposium on intelligence in neural and biological systems, Herndon, VA, May 1995. IEEE, Washington, DC, pp 38–45

    Google Scholar 

  • Post E (1943) Formal reductions of the general combinatorial decision problem. Am J Math 65:197–215

    Article  MathSciNet  MATH  Google Scholar 

  • Reif J (1995) Parallel molecular computation. In: SPAA'95: 7th annual ACM symposium on parallel algorithms and architectures, Santa Barbara, CA, July 1995, pp 213–223

    Google Scholar 

  • Reif J (1999) Parallel biomolecular computation: models and simulations. Algorithmica 25:142–176

    Article  MathSciNet  MATH  Google Scholar 

  • Rinaudo K, Bleris L, Maddamsetti R, Subramanian S, Weiss R, Benenson Y (2007) A universal RNAi-based logic evaluator that operates in mammalian cells. Nat Biotechnol 25:795–801. (Published online: May 21, 2007 – doi:10.1038/nbt1307.)

    Article  Google Scholar 

  • Rooß D, Wagner K (1996) On the power of DNA-computing. Infor Comput 131:95–109

    Article  MATH  Google Scholar 

  • Rose JA, Deaton RJ, Hagiya M, Suyama A (2002a) Equilibrium analysis of the efficiency of an autonomous molecular computer. Phys Rev E 65:021910

    Article  Google Scholar 

  • Rose JA, Hagiya M, Deaton RJ, Suyama A (2002b) A DNA-based in vitro genetic program. J Biol Phys 28:493–498

    Article  Google Scholar 

  • Rose JA, Komiya K, Yaegashi S, Hagiya, M (2006) Displacement Whiplash PCR: optimized architecture and experimental validation. In: Mao C, Yokomori T (eds) DNA computing. 12th international workshop on DNA-based computers, Seoul, Korea, June 2006. Lecture notes in computer science, vol 4287, pp 393–403

    Chapter  Google Scholar 

  • Rose JA, Takano M, Hagiya M, and Suyama A (2003) A DNA computing-based genetic program for in vitro protein evolution via constrained pseudomodule shuffling. J Genet Programming Evolvable Mach 4:139–152

    Article  Google Scholar 

  • Rothemund PWK (1995) A DNA and restriction enzyme implementation of Turing machines. In: Lipton J, Baum B (eds) DNA based computers. DIMACS series in discrete mathematics and theoretical computer science, vol 27. American Mathematical Society, Providence, RI, pp 75–119

    Google Scholar 

  • Rothemund PWK, Papadakis N, Winfree E (Dec 2004) Algorithmic self-assembly of DNA Sierpinski triangles. PLoS Biol 2(12):e424

    Article  Google Scholar 

  • Rozenberg G, Salomaa A (eds) (1997) Handbook of formal languages, 3 volumes. Springer, Berlin

    Google Scholar 

  • Salomaa A (1985) Computation and automata. Cambridge University Press, Cambridge

    MATH  Google Scholar 

  • Sakakibara Y, Ferretti C (1997) Splicing on tree-like structures. In: Proceedings of 3rd DIMACS meeting on DNA based computers, University of Pennsylvania, Philadelphia, PA, June 23–25, 1997, pp 348–358. Also, in Theor Comput Sci 185:15–45, 1999

    Google Scholar 

  • Sakakibara Y, Kobayashi S (2001) Sticker systems with complex structures. Soft Comput 5:114–120

    Article  MATH  Google Scholar 

  • Sakakibara Y, Suyama A (2000) Intelligent DNA chips: logical operation of gene expression profiles on DNA computers. In: Genome Informatics 2000: Proceedings of 11th workshop on genome informatics, Tokyo, Japan, December 2000. Universal Academy Press, Tokyo, Japan, pp 33–42

    Google Scholar 

  • Sakamoto K, Gouzu H, Komiya K, Kiga D, Yokoyama S, Yokomori T, Hagiya M (2000) Molecular computation by DNA hairpin formation. Science 288:1223–1226

    Article  Google Scholar 

  • Sakamoto K, Kiga D, Komiya K, Gouzu H, Yokoyama S, Ikeda S, Sugiyama H, Hagiya M (1999) State transitions by molecules. BioSystems 52(1–3):81–91

    Article  Google Scholar 

  • Seelig G, Yurke B, Winfree E (2006a) Catalyzed relaxation of a metastable DNA fuel. J Am Chem Soc 128(37):12211–12220

    Article  Google Scholar 

  • Seelig G, Soloveichik D, Zhang DY, Winfree E (Dec 2006b) Enzyme-free nucleic acid logic circuits. Science 314(5805):1585–1588

    Article  Google Scholar 

  • Shih W (Feb 2008) Biomolecular assembly: dynamic DNA. Nat Mater 7(2):98–100

    Article  Google Scholar 

  • Siromoney R, Subramanian KB, Rajkumar Dare V (1992) Circular DNA and splicing systems. In: Proceedings of Parallel Image Analysis, Ube, Japan, December 1992. Lecture notes in computer science, vol 654. Springer, Berlin, pp 260–273

    Google Scholar 

  • Smith WD (1995) DNA computers in vitro and vivo. In: Lipton J, Baum B (eds) DNA based computers. DIMACS series in discrete mathematics and theoretical computer science, vol 27. American Mathematics Society, Providence, RI, pp 121–185

    Google Scholar 

  • Stojanovic MN, Mitchell TE, Stefanovic D (Apr 2002) Deoxyribozyme-based logic gates. J Am Chem Soc 124(14):3555–3561

    Article  Google Scholar 

  • Stojanovic MN, Semova S, Kolpashchikov D, Macdonald J, Morgan C, Stefanovic D (May 2005) Deoxyribozyme-based ligase logic gates and their initial circuits. J Am Chem Soc 127(19):6914–6915

    Article  Google Scholar 

  • Stojanovic MN, Stefanovic D (Sep 2003) A deoxyribozyme-based molecular automaton. Nat Biotechnol 21(9):1069–1074

    Article  Google Scholar 

  • Takinoue M, Kiga D, Shohda K, Suyama A (2008) Experiments and simulation models of a basic computation element of an autonomous molecular computing system. Phys Rev E 78:041921

    Article  Google Scholar 

  • Tanaka F, Tsuda T, Hagiya M (2009) Towards DNA comparator: the machine that compares DNA concentrations. In: Goel A, Simmel FC (eds) DNA computing, 14th international workshop on DNA-based computers, Prague, Czech Republic, June 2008. Lecture notes in computer science, vol 5347, pp 11–20

    Google Scholar 

  • Tarnlund S (1977) Horn clause computability. BIT 17:215–226

    Article  MathSciNet  Google Scholar 

  • Uejima H, Hagiya M, Kobayashi S (2001) Horn clause computation by self-assembly of DNA molecules. In: Proceedings of 7th international workshop on DNA-based computers, Tampa, FL, June 2001. Lecture notes in computer science, vol 2340, pp 308–320

    Google Scholar 

  • Vaintsvaig MN, Liberman EA (1973) Formal description of cell molecular computer. Biofizika 18:939–942

    Google Scholar 

  • Venkataraman S, Dirks RM, Rothemund PWK, Winfree E, Pierce NA (2007) An autonomous polymerization motor powered by DNA hybridization. Nat Nanotechnol 2:490–494

    Article  Google Scholar 

  • Wang H (1961) Proving theorems by pattern recognition-II. Bell Syst Tech J 40:1–41

    Google Scholar 

  • Wang H (1962) Dominoes and the AEA case of the decision problem. In: Proceedings of the symposium on mathematical theory of automata. New York, April 1962. Polytechnic Institute of Brooklyn, Brooklyn, New York, pp 23–55

    Google Scholar 

  • Win MN, Smolke CD (Oct 2008) Higher-order cellular information processing with synthetic RNA devices. Science 322(5900):456–460

    Article  Google Scholar 

  • Winfree E (1998) Algorithmic self-assembly of DNA. Ph.D. thesis, California Institute of Technology

    Google Scholar 

  • Winfree E, Eng T, Rozenberg G (2000) String tile models for DNA computing by self-assembly. In: Proceedings of the 6th international meeting on DNA based computers. Leiden University, Leiden, the Netherlands, June 13–17, 2000, pp 65–84

    Google Scholar 

  • Winfree E, Yang X, Seeman NC (1996) Universal computation via self-assembly of DNA: some theory and experiments DNA based computers II. DIMACS series in discrete mathematics and theoretical computer science, vol 44. American Mathematical Society, Providence, RI, pp 191–213

    Google Scholar 

  • Wood D, Bi H, Kimbrough S, Wu D-J, Chen J (2002) DNA starts to learn poker. In: Jonoska N, Seeman N (eds) DNA computing, 7th international workshop on DNA-based computers Tampa, FL, June 2001. Lecture notes in computer science, vol 2340, pp 22–32

    Google Scholar 

  • Yin P, Choi HMT, Calvert CR, Pierce NA (Jan 2008a) Programming biomolecular self-assembly pathways. Nature 451(7176):318–322

    Article  Google Scholar 

  • Yin P, Hariadi RF, Sahu S, Choi HMT, Park SH, LaBean TH, Reif JH (2008b) Programming DNA tube circumferences. Science 321:824–826

    Article  Google Scholar 

  • Yokomori T (1999) Computation = self-assembly+ conformational change: toward new computing paradigms. In: DLT'99: Proceedings of 4th international conference on developments in language theory, Aachen, Germany, July 1999, pp 21–30

    Google Scholar 

  • Yokomori T (2000) YAC: yet another computation model of self-assembly. In: Winfree E, Gifford DK (eds) DNA based computers V. DIMACS series in discrete mathematics and theoretical computer science, vol 54. American Mathematical Society, Providence, RI, pp 155–169

    Google Scholar 

  • Yokomori T, Kobayashi S (1999) DNA-EC: a model of DNA computing based on equality checking. DNA based computers III. DIMACS series in discrete mathematics and theoretical computer science, vol 48. American Mathematical Society, Providence, RI, pp 347–360

    Google Scholar 

  • Yokomori T, Kobayashi S, Ferretti C (1997) On the power of circular splicing systems and DNA computability. In: Proceedings of IEEE international conference on evolutionary computation, Indianapolis, IN, April 1997, IEEE Service Center, pp 219–224

    Google Scholar 

  • Yokomori T, Sakakibara Y, Kobayashi S (2002) A magic pot: self-assembly computation revisited. In: Brauer W, Ehrig H, Karhumaki J, Salomaa A (eds) Formal and natural computing. Lecture notes in computer science, vol 2300. Springer, Berlin, pp 418–429

    Google Scholar 

  • Yurke B, Mills AP Jr (2003) Using DNA to power nanostructures. Genet Programming Evolvable Mach 4:111–122

    Article  Google Scholar 

  • Zhang DY, Turberfield AJ, Yurke B. Winfree E (Nov 2007) Engineering entropy-driven reactions and networks catalyzed by DNA. Science 318(5853):1121–1125

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Graduate School of Information Science and Technology, The University of Tokyo, Tokyo, Japan

    Masami Hagiya

  2. Department of Computer Science, University of Electro-Communications, Tokyo, Japan

    Satoshi Kobayashi

  3. Interdisciplinary Graduate School of Science and Engineering, Tokyo Institute of Technology, Yokohama, Japan

    Ken Komiya

  4. Department of Computer Science, Graduate School of Information Science and Technology, The University of Tokyo, Tokyo, Japan

    Fumiaki Tanaka

  5. Department of Mathematics, Faculty of Education and Integrated Arts and Sciences, Waseda University, Tokyo, Japan

    Takashi Yokomori

Authors
  1. Masami Hagiya
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Satoshi Kobayashi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ken Komiya
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Fumiaki Tanaka
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Takashi Yokomori
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LIACS, Leiden University, Leiden, The Netherlands

    Grzegorz Rozenberg

  2. Computer Science Department, University of Colorado, Boulder, USA

    Grzegorz Rozenberg

  3. LIACS, Leiden University, Leiden, The Netherlands

    Thomas Bäck

  4. LIACS, Leiden University, Leiden, The Netherlands

    Joost N. Kok

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this entry

Cite this entry

Hagiya, M., Kobayashi, S., Komiya, K., Tanaka, F., Yokomori, T. (2012). Molecular Computing Machineries — Computing Models and Wet Implementations. In: Rozenberg, G., Bäck, T., Kok, J.N. (eds) Handbook of Natural Computing. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92910-9_34

Download citation

Publish with us

Policies and ethics

Search

Navigation