Skip to main content
SpringerLink
Log in

Biomolecular Computing and Programming

Extended Abstract

  • Conference paper
  • First Online:
Book cover SOFSEM’99: Theory and Practice of Informatics (SOFSEM 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1725))

  • 391 Accesses

Abstract

Molecular computing is a discipline that aims at harnessing individual molecules at nanoscales to perform computations. The best studied molecules for this purpose to date have been DNA and bacteriorhodopsin. Biomolecular computing allows one to realistically entertain, for the first time in history, the possibility of exploiting the massive parallelism at nanoscales for computational power. This talk will discuss major achievements to date, both experimental and theoretical, as well as challenges and major potential advances in the immediate future.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Adleman, “Molecular computation of solutions of combinatorial problems,” Science 266, pp. 1021–1024, 1994.

    Article  Google Scholar 

  2. M. R. Garey, D. S. Johnson, Computers and Intractability. New York: Freeman, 1979.

    MATH  Google Scholar 

  3. L. Landweber, L. Kari, “The Evolution of Cellular Computing:Nature’s Solution to a Computational Problem,” in [55], pp. 3–13.

    Google Scholar 

  4. A. Cukras, D. Faulhammer, R. Lipton, L. Landweber, “Chess games:A model for RNA-based computation,” in [55], pp. 15–26.

    Google Scholar 

  5. D. Faulhammer, A. Cukras, R. Lipton, L. Landweber, “When the Knight Falls: On Constructing an RNA Computer,” in [56], pp. 1–7.

    Google Scholar 

  6. R. Birge, “Protein-based Three-Dimensional Memory,” The American Scientist 82, pp. 348–355, 1994.

    Google Scholar 

  7. R. Birge, “Protein-based Computers,” Scientific American, 1995.

    Google Scholar 

  8. A. D. Ellington, M. P. Robertson, K. D. James, J. C. Fox, “Strategies for DNA Computing,” in [21], pp. 173–184.

    Google Scholar 

  9. M. P. Robertson, J. Hesselberth, J. C. Fox, A. D. Ellington, “Designing and Selecting Components for Nucleic Acid Computers,” in [56], pp. 183–188.

    Google Scholar 

  10. E. T. Kool, “New Molecular Strategies for Joining, Pairing, and Amplifying,” in [56], pp. 62.

    Google Scholar 

  11. J. D. Watson, N. H. Hopkins, J. W. Roberts, J. A. Steitz, and A. M. Weiner, 4th ed., Molecular Biology of the Gene. Menlo Park, CA: The Benjamin/Cummings Publishing Co., Inc, 1987.

    Google Scholar 

  12. F. M. Ausubel, R. Brent, R. E. Kingston, D. D. Moore, J. G. Seidman, J. A. Smith, K. Struhl, P. Wang-Iverson and S. G. Bonitz. Current Protocols in Molecular Biology, New York: Greene Publishing Associates and Wiley-Interscience, 1993.

    Google Scholar 

  13. T. Head, “Formal language theory and DNA: An analysis of the generative capacity of specific recombination behaviors,” Bull. Math. Biology, pp. 49–73, 1985.

    Google Scholar 

  14. L. Landweber, R. Lipton, R. Dorit, A. Ellington (organizers), Dimacs Workshop on Nuclei Acid Selection and Computing, Princeton University, March 1998. http://dimacs.rutgers.edu/Workshops/NucleicAcid/index.html, http://www.princeton.edu/~lfl/poster.html.

  15. Q. Ouyang, P. D. Kaplan, S. Liu, A. Libchaber, “DNA Solution of the Maximal Clique Problem,” Science 278, pp. 446–449, 1997.

    Article  Google Scholar 

  16. M. Arita, A. Suyama, M. Hagiya, “A Heuristic Approach for Hamiltonian Path Problems with Molecules,” in [81], pp. 457–462, 1997.

    Google Scholar 

  17. R. Lipton, “Using DNA to solve NP-complete problems,” Science 265, pp. 542–545, 1995. See also, “Speeding up computations via molecular biology,” [53], pp. 67-74.

    Google Scholar 

  18. M. Ogihara, A. Ray, “DNA-Based Self-Propagating Algorithm for Solving Bounded Fan-in Boolean Circuits,” in [57], pp. 725–730.

    Google Scholar 

  19. M. Amos, P. E. Dunne, A. Gibbons, “DNA Simulation of Boolean Circuits,” in [57], pp. 679–683.

    Google Scholar 

  20. N. Morimoto, M. Arita, A. Suyama, “Solid phase DNA solution to the Hamiltonian Path Problem,” in [54].

    Google Scholar 

  21. H. Rubin. D. Wood (Eds.), Proc. of the Third DIMACS Workshop on DNA-Based Computers, The University of Pennsylvania, 1997. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Providence, RI: American Mathematical Society, vol. 48, 1999.

    Google Scholar 

  22. M. Hagiya, M. Arita, D. Kiga, K. Sakamoto, S. Yokohama, “Towards parallel evaluation and learning of Boolean µ-formulas with molecules,” in [81], pp. 105–115.

    Google Scholar 

  23. K. Sakamoto, D. Kiga, K. Komiya, H. Gouzu, S. Yokohama, S. Ikeda, H. Sugiyama, M. Hagiya, “State Transitions by Molecules,” in [57], pp. 87–99, 1998.

    Google Scholar 

  24. E. Winfree, “Whiplash PCR for O(1) Computing,” in [55], pp. 175–188.

    Google Scholar 

  25. M. Garzon, Y. Gao, J. A. Rose, R. C. Murphy, D. Deaton, D. R. Franceschetti, S. E. Stevens Jr.. “In-Vitro Implementation of Finite-State Machines,” Proc. 2nd Workshop on Implementing Automata WIA-97. Lecture Notes in Computer Science 1436, Berlin: Springer-Verlag, pp. 56–74, 1998.

    Google Scholar 

  26. M. Nelson, E. Raschke, M. McClelland, “E ect of site-specific methylation on restriction endonucleases and DNA modification methyltranferases,” Nucleic Acids Research, 21:13, pp. 31–39, 1993.

    Google Scholar 

  27. E. Shapiro, “A Mechanical Turing Machine:Blueprint for a Biomolecular Computer,” in [56], pp. 229–230.

    Google Scholar 

  28. L. Landweber, R. Lipton, M. O. Rabin. “DNA2DNA Computation: A potential Killer-App?,” in [21], pp. 162–172.

    Google Scholar 

  29. R. Deaton, R. C. Murphy, M. Garzon, D. R. Franceschetti, S. E. Stevens, Jr., “Good Encodings for DNA-based Solutions to Combinatorial Problems,” in [54], pp. 159–171, 1995.

    Google Scholar 

  30. D. Boneh, C. Dunworth, R. J. Lipton, J. Sgall, “Making DNA Computers Error resistant,” in [54], pp. 163–171.

    Google Scholar 

  31. R. Karp, C. Kenyon, O. Waarts, “Error-resilient DNA Computation,” Proc. 7th Annual Symposium on Discrete Algorithms SODA, pp. 458–467, 1996.

    Google Scholar 

  32. E. Baum, “DNA sequences useful for computation,” in [54], pp. 122–127.

    Google Scholar 

  33. J. G. Wetmur, “Physical Chemistry of Nucleic Acid Hybridization, ” in [21], pp. 1–23.

    Google Scholar 

  34. J. SantaLucia, Jr., H. T. Allawi, and P. A. Seneviratne, “Improved nearest-neighbor parameters for predicting DNA duplex stability,” Biochemistry, vol. 35, pp. 3555–3562, 1996.

    Article  Google Scholar 

  35. R. Deaton, M. Garzon, R. C. Murphy, J. A. Rose, D. R. Franceschetti, S. E. Stevens, Jr., “On the Reliability and Effciency of a DNA-Based Computation,” Physical Review Letters 80:2, pp. 417–420, 1998.

    Article  Google Scholar 

  36. A. J. Hartemink, D. K. Gifford, “Thermodynamic Simulation of Deoxyoligonucleotide Hybridization of DNA Computation,” in [21], pp. 25–37.

    Google Scholar 

  37. R. Deaton, D. R. Franceschetti, M. Garzon, J. A. Rose, R. C. Murphy, S. E. Stevens, Jr., “Information Transfer through Hybridization Reactions in DNA based Computing,” in [81], pp. 463–471.

    Google Scholar 

  38. R. Deaton, M. Garzon, J. A. Rose, D. R. Franceschetti, S. E. Stevens, Jr.. “DNA Computing: a Review,” Fundamenta Informaticae 35, pp. 231–245, 1998.

    MATH  MathSciNet  Google Scholar 

  39. R. Deaton, R. Murphy, J. Rose, M. Garzon, D. 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, Indiana, 267271, 1997.

    Google Scholar 

  40. J. Chen, E. Antipov, B. Lemieux, W. Cedeño, D. H. Wood, “A DNA Implementation of the Max 1s Problem,” in [82], 1835–1841.

    Google Scholar 

  41. R. Deaton, M. Garzon, R. C. Murphy, J. A. Rose, D. R. Franceschetti, S. E. Stevens, Jr. “Genetic Search of Reliable Encodings for DNA-based Computation,” Late Breaking papers-First Annual Genetic Programming Conference, Stanford University, pp. 9–15, 1996.

    Google Scholar 

  42. J. Khodor, D. K. Gifford, A. Hartemink, “Design and Implementation of Computational Systems Based on Programmed mutagenesis, ” in [55], 101-107; pp. 287–297, 1998.

    Google Scholar 

  43. M. Garzon, R. Deaton, J. A. Rose, D. R. Franceschetti, “Soft Molecular Computing,” in [56], pp. 89–98.

    Google Scholar 

  44. A. G. Frutos, Q. Liu, A. J. Thiel, A. W. Sanner, A. E. Condon, L. M. Smith, R. M. Corn, “Demonstration of a word design strategy for DNA computing on surfaces, ” Nucleic Acids Res. 25:23, pp. 4748–4757, 1997.

    Article  Google Scholar 

  45. A. G. Frutos, L. M. Smith, R. M. Corn, “Enzymatic Ligation Reactions of DNA Words on Surfaces for DNA Computing, ” J. Am. Chem Soc. 120:40, pp. 10277–10282, 1998.

    Article  Google Scholar 

  46. J. A. Rose, R. Deaton, D. R. Franceschetti, M. H. Garzon, S. E. Stevens, Jr., “A Statistical Mechanical Treatment of Error in the Annealing Biostep of DNA Computation, ” in [82], 1829–1834.

    Google Scholar 

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

    Google Scholar 

  48. A. Marathe, A. E. Condon, R. M. Corn, “On Combinatorial DNA Word Design,” in [56], pp. 75–88.

    Google Scholar 

  49. M. Garzon, P. Neathery, R. Deaton, R. C. Murphy, D. R. Franceschetti, S. E. Stevens, Jr., “A New Metric for DNA Computing,” in [81], pp. 472–478.

    Google Scholar 

  50. L. M. Adleman, “On Constructing a Molecular Computer,” in [53], pp. 1–21.

    Google Scholar 

  51. B. T. Zhang, S. Y. Shin, “Molecular Algorithms for Efficient and Reliable DNA Computing,” in [57], pp. 735–742.

    Google Scholar 

  52. S. Roweis, E. Winfree, R. Burgoyne, N. V. Chelyapov, N. F. Goodman, P. W. Rothemund, L. M. Adleman, “A Sticker Based Model for DNA Computation,” in [54], pp. 1–29.

    Google Scholar 

  53. R. Lipton, E. Baum (Eds.), DNA Based Computers. Proc. of the First DIMACS Workshop on DNA-Based Computers, Princeton University, 1995. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Providence, RI: American Mathematical Society, vol. 27, 1996. 185, 187, 188, 188

    Google Scholar 

  54. L. F. Landweber, E. B. Baum (Eds.),DNA Based Computers II, Proc. of the Second DIMACS Workshop on DNA-Based Computers, Princeton University, 1996. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Providence, RI:American Mathematical Society, vol. 44, 1999.

    Google Scholar 

  55. H. Rubin. D. Wood (Eds.), 4th DIMACS workshop on DNA Computers, University of Pennsylvania, 1998. Proceedings in a special issue of Biosystems, in press.

    Google Scholar 

  56. E. Winfree, D. Gifford (Eds.), Proc. of the Fifth International Metting on DNA Based Computers, MIT, Boston, MA. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Providence, RI: American Mathematical Society, In press. http://psrg.lcs.mit.edu/dna5/.

  57. J. R. Koza, K. Deb, M. Dorigo, D. B. Fogel, M. Garzon, H. Iba, R. L. Riolo (Eds.), Proc. 3rd Annual Genetic Programming Conference, San Mateo, CA: Morgan Kaufmann, 1998

    Google Scholar 

  58. L. M. Smith, R. M. Corn, A. E. Condon, M. G. Lagally, A. G. Frutos, Q. Liu, A. J. Thiel. “A Surface-Based Approach to DNA Computation,” J. Comput. Biology 5:2, pp. 255–267, 1998.

    Article  Google Scholar 

  59. M. Conrad, “On Design Principles for a Molecular Computer,” Comm. of the Ass. Comp. Mach. CACM, 28:5 1985, pp. 464–480, 1985.

    Google Scholar 

  60. M. Conrad, “Molecular and Evolutionary Computation: the Tug of War between Context-Freedom and Context-Sensitivity,” in [55], pp. 117–129, 1998.

    Google Scholar 

  61. J. Chen, E. Antipov, B. Lemieux, W. Cedeño, D. H. Wood, “In vitro Selection for a Max 1s DNA Genetic Algorithm,” in [56], pp. 23–37.

    Google Scholar 

  62. R. Deaton, M. Garzon, J. A. Rose, “A DNA Based Arti cial Immune System for Self-NonSelf Discrimination,” Proc. of the IEEE Int. Conference on Systems, Man and Cybernetics, Orlando. Piscataway, NJ: IEEE Press, pp. 369–374, 1997.

    Google Scholar 

  63. L. Landweber, E. Winfree, R. Lipton, S. Freeland (organizers), Work-shop on Evolution as Computation, Princeton University, January 1999. http://dimacs.rutgers.edu/Workshops/Evolution/.

  64. E. Winfree, “Universal computational via self-assembly of DNA: some theory and Experiments,” in [54], pp. 191–213.

    Google Scholar 

  65. E. Winfree, “Simulations of computing by self-assembly,” in [55], pp. 213–240.

    Google Scholar 

  66. E. Winfree. F. Liu, L. A. Wenzler, N. C. Seeman, “Design and Self-Assembly of Two-Dimensional DNA Crystals,” Nature 394 1998, pp. 539–544, 1998.

    Article  Google Scholar 

  67. N. Jonoska, S. A. Karl, “Ligation Experiments in DNA Computations,” Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC’97), April 13-16, pp. 261–265, 1997.

    Google Scholar 

  68. M. Hagiya, “Towards Autonomous Molecular Computers,” in [57], pp. 691–699, 1998.

    Google Scholar 

  69. M. H. Garzon, R. J. Deaton, Ken Barnes 1999. “On Self-Assembling Graphs in Vitro,” in [82], 1805–1809.

    Google Scholar 

  70. C. H. Bennet, “The Thermodynamics of Computation a Review,” Int. Journal of Theoretical Physics 21, pp. 905–940, 1982.

    Article  Google Scholar 

  71. P. Wilhem, K. Rothemund, “A DNA and restriction enzyme implementation of Turing Machines, ” in: [54] pp. 75–119, 1996.

    Google Scholar 

  72. W. Smith, “DNA Computers in vitro and vivo,” in: [53] pp. 121185, 1996.

    Google Scholar 

  73. E. Winfree, “On the computational power of DNA annealing and ligation,” in [53], pp. 199–215, 1995.

    Google Scholar 

  74. G. Paun (Ed.), Computing with Biomolecules: Theory and Experiments. Singapore: Springer-Verlag, 1998.

    Google Scholar 

  75. M. Amos, A. Gibbons, P. Dunne. “The Complexity and Viability of DNA Computations, ” Proc. Biocomputing and Computation (BCEC97), Lundh, Olsson and Narayanan (Eds.), Singapore: World Scientific, 1997.

    Google Scholar 

  76. S. A. Kurtz, S. R. Mahaney, J. S. Royer, and J. Simon, “Active transport in biological computing,” in [54], pp. 111–122.

    Google Scholar 

  77. M. Garzon, N. Jonoska, S. Karl. “The Bounded Complexity of DNA Computing,” in [55], in press.

    Google Scholar 

  78. J. Khodor, D. Gifford, “The Efficency of the Sequence-Speci c Separation of DNA Mixtures for Biological Computation,” in [21], pp. 25–37.

    Google Scholar 

  79. A. J. Hartemink, T. Mikkelsen, D. K. Gifford, “Simulating Biological reactions: A Modular Approach,” in [56], pp. 109–119.

    Google Scholar 

  80. D. H. Wood 1998, Basic DNA Computing, manuscript.

    Google Scholar 

  81. J. R. Koza, K. Deb, M. Dorigo, D. B. Fogel, M. Garzon, H. Iba, R. L. Riolo, (Eds.), Proc. 2nd Annual Genetic Programming Conference, San Mateo, CA: Morgan Kaufmann, 1997.

    Google Scholar 

  82. W. Bahnzhaf, A. E. Eiben, M. H. Garzon, D. E. Goldberg, V. Hanovar, M. Jakiela, J. R. Koza 1999. Proc. of the Genetic and Evolutionary Computation Conference GECCO-99, Orlando Florida. San Mateo, CA: Morgan Kaufmann.

    Google Scholar 

  83. M. Chee, R. Yang, E. Hubbell, A. Berno, X. C. Huang, D. Stern, J. Winkler, D. J. Lockhart, M. S. Morris, and S. P. A. Fodor, “Acessing genetic information with high-density DNA arrays,” Science, vol. 274, pp. 610–614, 1996.

    Article  Google Scholar 

  84. M. Garzon, R. Deaton, “Biomolecular Computing and Programming, ” IEEE Trans. Evol. Comput 3:3, 1999, in press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The University of Memphis, Memphis, TN, 38152

    Max H. Garzon

Authors
  1. Max H. Garzon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. 1Russell J. Deaton
    View author publications

    You can also search for this author in PubMed Google Scholar

Consortia

The Molecular Computing Group

Editor information

Editors and Affiliations

  1. DCIT, s.r.o, J. Martího 2/407, 162 02, Prague 6, Czech Republic

    Jan Pavelka

  2. Department of Computer Science, University of Utrecht, Padualaan 14, 3584, CH, Utrecht, The Netherlands

    Gerard Tel

  3. Institute of Computer Science, Masaryk University, Botanická 68a, 602 00, Brno, Czech Republic

    Miroslav Bartošek

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Garzon, M.H., Deaton, 1.J., The Molecular Computing Group. (1999). Biomolecular Computing and Programming. In: Pavelka, J., Tel, G., Bartošek, M. (eds) SOFSEM’99: Theory and Practice of Informatics. SOFSEM 1999. Lecture Notes in Computer Science, vol 1725. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47849-3_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-47849-3_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66694-3

  • Online ISBN: 978-3-540-47849-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation