Abstract
Biomolecular computing (BMC) aims to capture the innumerable advantages that biological molecules have gained in the course of millions of years for computational purposes. While biomolecules have resolved fundamental problems as a parallel computer system that we are just beginning to decipher, BMC still suffers from our inability to harness these properties to bring biomolecular computations to levels of reliability, efficiency and scalability that are now taken for granted with solid-state based computers. In the same way that evolutionary algorithms capture, in silico, the key properties of natural evolution, we explore an alternative approach to exploiting these properties by building virtual test tubes in electronics that would capture the best of both worlds. We describe a distributed implementation of a virtual tube, EdnaCo, on a cluster of PCs that aims to capture the massive asynchronous parallelism of BMC. We report several experimental results, such as solutions to the Hamiltonian Path problem (hpp) for large families of graphs than has been possible on a single processor or has been actually carried out in wet labs. The results show that the paradigm of molecular computing can be implemented much more efficiently (in terms of time, cost, and probability of success) in silico than the corresponding wet experiments, at least in the range where eDNA can be practically run. Consequently, we pinpoint the appropriate range of problem sizes and properties where wet biomolecular solutions would offer superior solutions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
L. M. Adleman, Molecular Computation of Solutions to Combinatorial Problems. Science, 266, 1021 (1994).
W. Banzhaf, J. Daida, A.E. Eiben, M.H. Garzon, V. Hanovar, M. Jakiela, R.E. Smith, (eds.), Proc. of The Genetic and Evolutionary Computation Conference GECCO, Orlando, FL, July 1999, Morgan Kaufmann.
R. Cantor, P. R. Schimmel, Biophysical Chemistry, Part III: The Behavior of Biological Macromolecules Freeman, New York, 1980.
A. Condon, G. Rozenberg (eds.), DNA Computing (Revised papers), Proc. of the 6th International Workshop on DNA-based Computers. Leiden University, The Netherlands, 2000. Springer-Verlag Lecture Notes in Computer Science 2054 (2000), 247–258, Heidelberg.
D. Whitley, D. Goldebrg, E. Cantu-Paz, L. Spector, I. Parmee, H.G. Beyer (eds.), Proc. of The Genetic and Evolutionary Computation Conference GECCO-00, Las Vegas, 2000, Morgan Kaufmann.
T.L. Eng, “On Solving 3CNF-satisfiability with an in-vivo algorithm.” In [22], 135–141.
R. Deaton, M. Garzon, R. E. Murphy, J. A. Rose, D. R. Franceschetti, S.E. Stevens, Jr. The Reliability and Efficiency of a DNA Computation. Phys. Rev. Lett. 80 (1998), 417.
R. Deaton, R. E. Murphy, J. A. Rose, Max Garzon, D. R. Franceschetti, S.E. Stevens, Jr. A DNA based Implementation of an Evolutionary Search for Good Encodings for DNA Computation. Proc. IEEE Conference on Evolutionary Computation ICEC (1997), 267–271.
M. Garzon, Models of Massive Parallelism (Analysis of Cellular Automata and Neural Networks). Springer-Verlag, Berlin, 1995.
M. Garzon, P. Neathery, R. Deaton, R.C. Murphy, D.R. Franceschetti, S.E. Stevens, Jr. A New Metric for DNA Computing. In [18], 472–478.
M. Garzon, R. Deaton, J.A. Rose, D.R. Franceschetti, Soft Molecular Computing. Proc. of the 4th workshop, Princeton University, 1998. In [23], 89–98.
M. Garzon, E. Drumwright, R.J. Deaton, D. Renault, Virtual Test Tubes: a New Methodology for Computing. Proc. 7th Int. Symposium on String Processing and Information Retrieval. A Coruña, Spain. IEEE Computer Society Press, 2000, 116–121.
A. Nishikawa and M. Hajiya. Towards a System for Simulating DNA Computing with Whiplash PCR, Proc. of the Congress on Evolutionary Computation CEC-99.
A. J. Hartemink, D. K. Gifford, Thermodynamic Simulation of Deoxyoligonu-cleotide Hybridization of DNA Computation. In [22], 25–38.
A. J. Hartemink, T. Mikkelsen, D. K. Gifford, Simulating Biological Reactions: A Modular Approach. In [23], 109–120.
S. Ji, “The Cell as the smallest DNA-based Molecular Computer.” In [22], 123–133.
J. Khodor, D.K. Gifford, A. Hartemink (1998), Design and Implementation of Computational Systems Based on Programmed mutagenesis. In [22], 93–97.
J.R. Koza, K. Deb, M. Dorigo, D.B. Fogel, M. Garzon, H. Iba, R.L. Riolo, eds. (1997). Proc. 2nd Annual Genetic Programming Conference, Morgan Kaufmann.
J.R. Koza, K. Deb, M. Dorigo, D.B. Fogel, M. Garzon, H. Iba, R.L. Riolo, eds. (1998). Proc. 3rd Annual Genetic Programming Conference, Morgan Kaufmann.
L.F. Landweber, E.B. Baum (eds.), DNA Based Computers II, Proc. of the 2nd workshop, Princeton University, 1996. DIMACS series of the American Mathematical Society 44 (1999), 247–258, Providence RI.
J. A. Rose, R. Deaton, D. R. Franceschetti, M. Garzon, S. E. Stevens, Jr., A Statistical Mechanical Treatment of Error in the Annealing Biostep of DNA Computation. In [2], 1829–1834.
L. Kari, H. Rubin. D. Wood (eds.), 4th DIMACS workshop on DNA Computers. Special Issue of Biosystems (J. of Biological and Information Processing Sciences) 53:1–3. Elsevier.
L. Kari, E. Winfree and D. Gifford (eds.), Proc. 5th workshop on DNA Computers, MIT, Cambridge, MA, 1999. DIMACS series of the American Mathematical Society 54 (1999), 247–258, Providence RI.
J. SantaLucia, Jr., A unified view of polymer, dumbbell, and oligonucleotideDNA nearest-neighbor thermodynamics. Proc. Natl. Acad. Sci. 95 (1998), 1460.
M. Sipper, Evolution of Parallel Cellular Machines (The Cellular Programming Approach). Springer-Verlag, Berlin.
W. D. Smith, DNA Based Computers, Princeton University, 1996, DIMACS Proc. Series (American Mathematical Society, Providence, RI, 1996).
J. G. Wetmur, Preliminary Proceedings of the Third Annual Meeting on DNA Based Computers, University of Pennsylvania, 1997, DIMACS Proc. Series (American Mathematical Society, Providence, RI, 1997).
B-T Zhang, S-Y Shin, Molecular Algorithms for Efficient and Reliable DNA Computing. In [19], 735–742.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Garzon, M.H., Oehmen, C. (2002). Biomolecular Computation in Virtual Test Tubes. In: Jonoska, N., Seeman, N.C. (eds) DNA Computing. DNA 2001. Lecture Notes in Computer Science, vol 2340. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48017-X_11
Download citation
DOI: https://doi.org/10.1007/3-540-48017-X_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43775-8
Online ISBN: 978-3-540-48017-4
eBook Packages: Springer Book Archive