Natural Computing

, Volume 3, Issue 4, pp 461–477 | Cite as

Virtual test tubes

For biomolecule-based computing


By their structure and operation, biomolecules have resolved fundamental problems as a distributed computational system that we are just beginning to unveil. One advantageous approach to gain a good understanding of the processes and algorithms involved is simulation on conventional computers. Simulations allow better understanding of the capabilities of molecules because they can occur at the level of reliability, efficiency, and programmability that are standard in conventional computation and are desirable for experiments in vitro. Here, we describe in some detail the architecture of a general-purpose simulation environment in silico, EdnaCo, establish its soundness and reliability, and benchmark its performance. The system can be described as an emulation of the events in a real test tube. We describe the major pieces of its architecture, namely, a distributed memory (file) system, a kinetic engine, and input/output mechanisms. Finally, the ability of this environment in preserving major features of the wet counterpart in vitro is evaluated via an implementation on a cluster of PCs. The results of several simulations are summarized that establish the soundness, utility, applicability, and cost efficiency of the software to facilitate experimentation in vitro.

Key words

biomolecular computing distributed computing molecular kinetics simulations of Brownian motion virtual test tubes 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Adleman, LM 1994Molecular computation of solutions to combinatorial problemsScience26610211024PubMedGoogle Scholar
  2. Baum, E 1995Building an associative memory vastly larger than the brainScience268583585Google Scholar
  3. Blain D, Garzon M, Shin SY, Zhang BT, Kashiwamura S, Yamamoto M, Kameda K and Ohuchi A (2004) Development, evaluation and benchmarking of simulation software for biomolecular computing. This issueGoogle Scholar
  4. Braich RS, Johnson C, Rothemund PWK, Hwang D, Chelyapov N and Adleman LA (2000) Solution to a satisfiability problem on a gel-based DNA computer. In: Lecture Notes in Computer Science LNCS, Vol. 2054, pp. 27–42, Springer-VerlagGoogle Scholar
  5. Cantor, C, Schimmel, P 1980Biophysical Chemistry, Part III: The Behavior of Biological MacromoleculesFreemanNew YorkGoogle Scholar
  6. Chen J and Reif J eds (2003) Proceedings of 9th international workshop on DNA-based computers DNA 2003 (Revised Papers). In: Lecture Notes in Computer Science LNCS, Vol. 2943, Springer-VerlagGoogle Scholar
  7. Chen J, Deaton R, Garzon M, Kim JW, Wood D, Bi H, Carpenter D and Wang YZ (2004) Characterization of non-crosshybridizing DNA oligonucleotides manufactured in vitro. In: (Ferreti et al., 2003), 132–141Google Scholar
  8. Deaton R, Chen J, Bi H, Garzon M, Rubin H and Wood D, (2002) A PCR-based protocol for in vitro selection of non-crosshybridizing oligonucleotides. In: (Chen and Reif, 2003), 105–114Google Scholar
  9. Deng, L 2004

    Generalized mersenne prime numbers and its application to random number generation

    Niederreiter, H eds. Monte Carlo and Quasi-Monte Carlo Methods.Springer-Verlag167180
    Google Scholar
  10. Einstein, A 1956Investigations on the theory of the Brownian movementReprint, Dover Publications IncNew York49Google Scholar
  11. Ferreti C, Mauri G and Zandron C eds (2004) Proceedings 10th international workshop on DNA-based computers DNA 2004. In: Lecture Notes in Computer Science LNCS, Springer-Verlag, in pressGoogle Scholar
  12. Fogel G, and Garry Greenwood et al. (eds) (2004) Proceedings of the IEEE Conference on Evolutionary Computation CEC04. Computer Society PressGoogle Scholar
  13. Garzon M and Oehmen C (2001) Biomolecular computation in virtual test tubes. Proceedings of 7th International workshop on DNA-based computers DNA 2002 (Revised Papers). In: Lecture Notes in Computer Science LNCS, Vol. 2340, pp. 117–128, Springer-VerlagGoogle Scholar
  14. Garzon, M 1995Models of Massive Parallelism (Analysis of Cellular Automata and Neural Networks)Springer-VerlagBerlinGoogle Scholar
  15. Garzon M, Bobba K and Hyde B (2004) Digital information encoding on DNA. In: Lecture Notes in Computer Science, Vol. 2590, pp. 152–166, Springer-VerlagGoogle Scholar
  16. Garzon M, Blain D, Bobba K, Neel A and West M (2003a) Self-Assembly of DNA-like structures In-Silico. In (Garzon, 2003), 185–200Google Scholar
  17. Garzon M, Drumwright E, Deaton R and Renault D (2000) Virtual test tubes: a new methodology for computing. In Proceedings of 7th International Symposium on String Processing and Information Retrieval. pp. 116–121, A Coruña, Spain. IEEE Computer Society PzzressGoogle Scholar
  18. Garzon M, Deaton R, Rose J, and Franceschetti D (1999) Soft molecular computing. In: Proceedings of the 5th workshop, MIT, Vol. 54, pp. 89–98, DIMACS Series American Mathematical SocietyGoogle Scholar
  19. Garzon, M eds. 2003Biomolecular Machines and Artificial EvolutionGenetic Programming and Evolvable MachinesKluwer Academic PublishersGoogle Scholar
  20. Garzon M, Neathery P, Deaton R, Murphy R, Franceschetti D and Stevens S Jr. (1997) A new metric for DNA computing. In: (Koza et al., 1997), 472–478Google Scholar
  21. Garzon M, Neel A and Bobba K (2003b) Efficiency and reliability of semantic retrieval in DNA-based memories. In: (Chen and Reif, 2003), 157–169Google Scholar
  22. Gentle, E 2003Random Number Generation and Monte Carlo MethodsSpringer-VerlagNew York51Google Scholar
  23. Hagiya M and Ohuchi A eds (2002) Proceedings of 8th international workshop on DNA-based computers DNA 2002 (Revised Papers). In: Lecture Notes in Computer Science LNCS, Vol. 2568, Springer-Verlag.Google Scholar
  24. Ji, S 1998The cell as the smallest DNA-based molecular computerBiosystems52123133Google Scholar
  25. Jonoska N, sa-Ardyen P and Seeman AN (1997) Computation by self-assembly of DNA graphs. In (Garzon, 2003), 123–137Google Scholar
  26. Kari L, Winfree E and Gifford D eds (1999) Proceedings of 5th workshop on DNA Computers, MIT, Cambridge MA, 1999, Vol. 54, pp. 247–258. DIMACS series of the American Mathematical SocietyGoogle Scholar
  27. Koza J, Deb K, Dorigo M, Fogel D, Garzon M, Iba H and Riolo R eds (1997). Proceedings of 2nd Annual Genetic Programming Conference. Morgan Kaufmann, San Mateo, CaliforniaGoogle Scholar
  28. SantaLucia J Jr (1998) A unified view of polymer, dumbbell, and oligonucleotideDNA nearest-neighbor thermodynamics. Proceedings of the National Academic Science 95(1998), 1460Google Scholar
  29. Schlick, T 2002Molecular Modeling and SimulationSpringer-VerlagNew York33Google Scholar
  30. Toffoli, T, Margolus, N 1987Cellular Automata Machines. In: A New Environment for Modeling MIT Press (1987)CambridgeMassachusettsGoogle Scholar
  31. West M and Garzon MH (2003) Self-Aseembly of DNA Structures In Silico for 3-Colorability. Poster at the 10th Int. Workshop on DNA-Based Computers. Milan, Italy, 2004Google Scholar
  32. West M, Garzon M, and Blain D (2003) DNA-like Genomes for Evolution in silico. In: Proceedings of GECCO-2003, The Genetic and Evolutionary Programming Conference Springer-Verlag Lecture Notes in Computer Science Vol. 2723, pp. 413–424Google Scholar
  33. Wetmur J (1997) Preliminary Proceedings of the Third Annual Meeting on DNA Based Computers, University of Pennsylvania, DIMACS Series American Mathematical Society 48, Providence, RIGoogle Scholar
  34. Winfree, W, Liu, F, Wenzler, LA, Seeman, NC 1998Design and self-assembly of two-dimensional DNA crystalsNature394539544CrossRefPubMedGoogle Scholar

Copyright information

© Kluwer Academic Publishers 2004

Authors and Affiliations

  • Max H Garzon
    • 1
  • Derrel R. Blain
    • 1
  • Andrew J. Neel
    • 1
  1. 1.Computer Science DivisionThe University of MemphisMemphisUSA

Personalised recommendations