Skip to main content
Log in

Self-Assembly of DNA-like Structures In Silico

  • Published:
Genetic Programming and Evolvable Machines Aims and scope Submit manuscript

Abstract

Through evolution, biomolecules have resolved fundamental problems as a highly interactive parallel and distributed system that we are just beginning to decipher. Biomolecular Computing (BMC) protocols, however, are unreliable, inefficient and unscalable when compared to computational algorithms run in silico. An alternative approach is explored to exploiting these properties by building biomolecular analogs (eDNA) and virtual test tubes in electronics that would capture the best of both worlds. A distributed implementation is described of a virtual tube, Edna, on a cluster of PCs that does capture the massive asynchronous parallel interactions typical of BMC. Results are reported from over 1000 experiments that calibrate and benchmark Edna's performance, reproduce and extend Adleman's solution to the Hamiltonian Path problem for larger families of graphs than has been possible on a single processor or has been actually carried out in wet labs, and benchmark the feasibility and performance of DNA-based associative memories. The results required a million-fold less molecules and are at least as reliable as in vitro experiments, and so provide strong evidence 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. This approach also demonstrates intrinsic advantages in using electronic analogs of DNA as genomes for genetic algorithms and evolutionary computation.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. L. M. Adleman, “Molecular computation of solutions to combinatorial problems,” Science, vol. 266, pp. 1021-1024, 1994.

    Google Scholar 

  2. A. Alexandrescu, Modern C++ Design, Addison-Wesley Addison-Wesley, pp. 99-119, 2001.

  3. R. Anderson, “Tree data structures for N-body simulation,” in IEEE Symposium on Foundations of Computer Science, 1996.

  4. E. Baum, “Building an associative memory vastly larger than the brain,” Science, vol. 268, pp. 583-585, 1995.

    Google Scholar 

  5. C. R. Cantor and P. R. Schimmel, Biophysical Chemistry, Part III: The Behavior of Biological Macromolecules Freeman: New York, 1980.

  6. A. Carbone N. Seeman, “Circuits and programmable self-assembling nanostructures,” in M. Hagiya and A. Ohuchi (eds.), in Proceedings of the 8th Int. Meeting on DNA Based Computers, Hokkaido University, June, 2002, Springer-Verlag, Lecture Notes in Computer Science 2568, Berlin [19], p. 29, 2002.

    Google Scholar 

  7. J. Chen and N. C. Seeman, “Synthesis from DNA of a molecule with the connectivity of a cube,” Nature, vol. 350, pp. 631-633, 1991.

    Article  Google Scholar 

  8. A. Condon and G. Rozenberg, DNA Computing (Revised papers), in Proc. of the 6th International Workshop on DNA-based Computers. Leiden University, The Netherlands, 2000, Springer-Verlag, Lecture Notes in Computer Science 2054, Berlin, 2001

    Google Scholar 

  9. R. Deaton, J. Chen, H. Bi, M. Garzon, H. Rubin, and D. H. Wood, “A PCR-based protocol for in-vitro selection of non-crosshybridizing oligonucleotdes,” in M. Hagiya and A. Ohuchi (eds.), in Proceedings of the 8th Int. Meeting on DNA Based Computers, Hokkaido University, June, 2002, Springer-Verlag, Lecture Notes in Computer Science 2568, Berlin [19], 2002, pp. 105-114.

    Google Scholar 

  10. R. Deaton, R. C. Murphy, M. Garzon, D. T. Franceschetti, and S. E. Stevens Jr., “Good encodings for DNA-based solutions to combinatorial problems,” in Proc. of the Second Annual Meeting on DNA Based Computer held at Princeton University, pp. 159-171, 1996.

  11. R. Deaton, M. Garzon, R. E. Murphy, J. A. Rose, D. R. Franceschetti, and S. E. Stevens Jr., “The reliability and efficiency of a DNA computation,” Phys. Rev. Lett., vol. 80, pp. 417-420, 1998.

    Article  Google Scholar 

  12. R. Deaton, R. C. Murphy, J. A. Rose, M. Garzon, D. T. Franceschetti, and S. E. Stevens Jr., “Genetic search for reliable encodings for DNA-based computation,” in Proc. First Conference on Genetic Programming, J. Koza (ed.), Morgan-Kaufmann: San Mateo, CA, 1996.

    Google Scholar 

  13. P. Dittrich, J. Ziegler, and W. Banzhaf, “Artificial chemistries—a review,” Artificial Life, vol. 7, pp. 225-275, 2001.

    Article  Google Scholar 

  14. T. L. Eng, “On solving 3CNF-satisfiability with an in-vivo algorithm,” in L. Kari, H. Rubin, and D. Wood (eds.), 4th DIMACS Workshop on DNA Computers Biosystems, Elsevier, vol. 53 [22], pp. 135-141, 1999.

  15. H. Gamma, V. Johnson, and A. Vlissides, Design Patterns, Addison-Wesley, pp. 233-242, 1995.

  16. M. Garzon and C. Oehmen, “Biomolecular computation in virtual test tubes,” in L. Kari, H. Rubin, and D. Wood (eds.), 4th DIMACS Workshop on DNA Computers Biosystems, Elsevier, vol. 53 [22], pp. 117-128, 2001.

  17. M. Garzon, R. Deaton, J. A. Rose, and D. R. Franceschetti, “Soft Molecular Computing,” in Proc. of the 5th workshop, Princeton University, in E. Winfree and D. Gifford (eds.), Providence,RI, American Mathematical Society [30], 1999, pp. 89-98.

    Google Scholar 

  18. M. Garzon, P. Neathery, R. Deaton, R. C. Murphy, D. R. Franceschetti, and S. E. Stevens Jr., “A new metric for DNA computing,” in Proc. Second Conference on Genetic Programming, J. Koza (ed.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Morgan Kaufmman: San Mateo, CA, 1996, pp. 472-478.

    Google Scholar 

  19. M. Hagiya and A. Ohuchi (eds.), in Proceedings of the 8th Int. Meeting on DNA Based Computers, Hokkaido University, June, 2002, Springer-Verlag, Lecture Notes in Computer Science 2568, Berlin, 2003.

    Google Scholar 

  20. S. Ji, “The cell as the smallest DNA-based molecular computer,” in L. Kari, H. Rubin, and D. Wood (eds.), 4th DIMACS Workshop on DNA Computers Biosystems, Elsevier, vol. 53 [22], pp. 123-133, 1999.

  21. N. Jonoska and N. Seeman (eds.), DNA Computing (Revised papers) in Proc. of the 7th International Workshop on DNA-based Computers. U. of South Florida, Tampa, 2001, Springer-Verlag, Lecture Notes in Computer Science 2340, Berlin, 2002.

  22. L. Kari, H. Rubin, and D. Wood (eds.), 4th DIMACS Workshop on DNA Computers Biosystems, Elsevier, vol. 53, pp. 1-3, 1999.

  23. D. Liu, J. H. Reif, and T. LaBean, “DNA Nanotubes: Construction and Characterization of Filaments Composed of TX-tile Lattice,” in M. Hagiya and A. Ohuchi (eds.), in Proceedings of the 8th Int. Meeting on DNA Based Computers, Hokkaido University, June, 2002, Springer-Verlag, Lecture Notes in Computer Science 2568, Berlin [19], pp. 31-38, 2001.

    Google Scholar 

  24. C. M. Niemeyer, “Self-assembled nanostructures based on DNA: towards the development of nanobiotechnology,” Current Opinion in Chemical Biology, vol. 4, pp. 609-618, 2000.

    Article  Google Scholar 

  25. N. Nishida, M. Wakui, Y. Ohashi, K. Tokunaga, and A. Suyama, “Highly specific and quantitative gene expression profiling based on DNA computing,” in M. Hagiya and A. Ohuchi (eds.), in Proceedings of the 8th Int. Meeting on DNA Based Computers, Hokkaido University, June, 2002, Springer-Verlag, Lecture Notes in Computer Science 2568, Berlin [19], p. 79, 2001.

    Google Scholar 

  26. T. Schlick, Molecular Modeling and Simulation. Series in Mathematical Biology, Springer Verlag, 2002.

  27. N. C. Seeman, “DNA engineering and its application to nanotechnology,” Trends in Biotechnology, vol. 17, pp. 437-443, 1999.

    Article  Google Scholar 

  28. J. Spencer, Ten Lectures on the Probabilistic Method, CMBS-NSF Series in Applied Mathematics SIAM, p. 17, 1987.

  29. J. G. Wetmur, “Physical Chemistry of Nucleic Acid Hybridization,” in Proc. 3rd DIMACS Workshop on DNA-Based Computers, DNA-Based Computers, U. of Pennsylvania, 1997, H. Rubin and D. Wood (eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Providence, RI, American Mathematical Society, vol. 48, 1999, pp. 1-23.

    Google Scholar 

  30. E. Winfree and D. Gifford (eds.),in 5th International Metting on DNA Based Computers, MIT, Boston, MA, 1999, Providence, RI, American Mathematical Society, 2000, pp. 1-23.

    Google Scholar 

  31. E. Winfree, E. F. Liu, L. A. Wenzler, and N. C. Seeman, “Design and self-assembly of two-dimensional DNA crystals,” Nature, vol. 394, pp. 539-544, 1998.

    Article  Google Scholar 

  32. D. H. Wood, J. Chen, B. Lemieux, and W. Cedeño, “A design for DNA computation of the OneMax problem,” in Soft Computing, vol. 5, M. Garzon and M. Conrad (eds.), 2001, pp. 19-24

  33. H. Zhang, H. X. Yan, Z. Shen, and N. C. Seeman, “A robust DNA mechanical device controlled by hybridization topology,” Nature, vol. 415, pp. 62-65, 2002.

    Article  Google Scholar 

  34. B. Yurke, A. J. Turberfield, A. P. Mills, F. C. Simmel, and J. L. Neumann, “A DNA-fuelled molecular machine made of DNA,” Nature, vol. 406, pp. 605-608, 2000.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Garzon, M., Blain, D., Bobba, K. et al. Self-Assembly of DNA-like Structures In Silico . Genet Program Evolvable Mach 4, 185–200 (2003). https://doi.org/10.1023/A:1023989130306

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1023989130306

Navigation