Skip to main content
SpringerLink
Log in

Trends in computing with DNA

  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

As an emerging new research area, DNA computation, or more generally biomolecular computation, extends into other fields such as nanotechnology and material design, and is developing into a new sub-discipline of science and engineering. This paper provides a brief survey of some concepts and developments in this area. In particular several approaches are described for biomolecular solutions of the satisfiability problem (using bit strands, DNA tiles and graph self-assembly). Theoretical models such as the primer splicing systems as well as the recent model of forbidding and enforcing are also described. We review some experimental results of self-assembly of DNA nanostructures and nanomechanical devices as well as the design of an autonomous finite state machine.

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

Access this article

Log in via an institution

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. Head T. Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors.Bull. Math. Biology, 1987, 49: 737–759.

    MATH  MathSciNet  Google Scholar 

  2. Adleman L. Molecular computation of solutions of combinatorial problems.Science, 1994, 266: 1021–1024.

    Article  Google Scholar 

  3. Lipton R, Baum E (Eds.) DNA based computers. InProc. the First Annual Meeting, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 27 Providence RI, American Mathematical Society, 1996.

  4. Landweber L, Baum E (Eds.). DNA based computers. InProc. the First Annual Meeting, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 44 Providence RI, American Mathematical Society, 1998.

  5. Rubin H, Wood D (Eds.), DNA based computers. InProc. the Third Annual Meeting DIMACS series in Discrete Math. and Theoretical Comp. Sci., Vol.48, 1999.

  6. Kari L, Wood D (Eds.),DNA based computers, revised papers. InProc. the Fourth Annual Meeting BioSystems (special issue), Vol.52, 1999.

  7. Winfree E, Gifford D K (Eds.). DNA based computers. InProc. the Fifth Annual Meeting, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 54 Providence RI, American Mathematical Society, 2000.

  8. Condon A, Rozenberg G (Eds.). DNA based computers. InProc. the Sixth Annual Meeting, LNCS 2054, Springer-Verlag, 2001.

  9. Jonoska N, Seeman N C (Eds.). DNA based computers. InProc. the Seventh Annual Meeting, LNCS 2340, Springer-Verlag, 2002.

  10. Hagiya M, Ohuchi A (Eds.). DNA based computers. InProc. the Eighth Annual Meeting, LNCS 2568, Springer-Verlag, 2002.

  11. Head T, Paun Gh, Pixton D. Language theory and molecular genetics. Handbook of Formal Languages, Vol.II, Rozenberg G, Salomaa A (Eds.), Springer Verlag, 1997, pp.295–358.

  12. Paun Gh, Rozenberg G, Salomaa A. DNA Computing, New Computing Paradigms. Springer Verlag, 1998.

  13. Kari L. DNA computing: Arrival of biological mathematics.The Mathematical Intelligencer, 1997, 19(2): 9–22.

    Article  MATH  MathSciNet  Google Scholar 

  14. Ausubel F M, Brent R, Kingston R Eet al. Current Protocols in Molecular Biology. Greene Publishing Associates and Wiley-Interscience, New York, 1993.

    Google Scholar 

  15. Seeman N C. The design of single-stranded nucleic acid knots.Molecular Engineering, 1992, 2: 197–307.

    Article  Google Scholar 

  16. Seeman N Cet al. The perils of polynucleotides: The experimental gap between the design and assembly of unusual DNA structures. in [4]Proc. the First Annual Meeting, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 44 Providence RI, American Mathematical Society, 1998, pp.215–234.

  17. Seeman N C, Zhang Y, Du S Met al. Construction of DNA polyhedra and knots through symmetry minimization.Supermolecular Stereochemistry, Siegel J S (Ed.), 1995, pp.27–32.

  18. Du S M, Wang H, Tse-Dinh Y C, Seeman N C. Topological transformations of synthetic DNA knots.Biochemistry, 1995, 34: 673–682.

    Article  Google Scholar 

  19. Mao C, Sun W, Seeman N C. Construction of borromean rings from DNA.Nature, 1997, 386: 137–138.

    Article  Google Scholar 

  20. Chen J, Seeman N C. Synthesis from DNA of a molecule with the connectivity of a cube.Nature, 1991, 350: 631–633.

    Article  Google Scholar 

  21. Chen J, Kallenbach N R, Seeman N C. A specific quadrilateral synthesized from DNA branched junctions.Journal of the American Chemical Society, 1989, 111: 6402–6407.

    Article  Google Scholar 

  22. Mao C, Sun W, Seeman N C. Designed two-dimensional Holliday junction arrays visualised by atomic force microscopy.Journal of the American Chemical Society, 1999, 121: 5437–5443.

    Article  Google Scholar 

  23. Seeman N Cet al. Gel electrophoretic analysis of DNA branched junctions.Electrophoresis, 1989, 10: 345–354.

    Article  Google Scholar 

  24. Seeman N C. Nucleic acid junctions and lattices.Journal of Theoretical Biology, 1982, 99: 237–247.

    Article  Google Scholar 

  25. Jonoska N, Sa-Ardyen P, Seeman N C. Computation by self-assembly of DNA graphs.Journal of Genetic Programming and Evolvable Machines, 2003, 4: 123–137.

    Article  Google Scholar 

  26. Winfree E, Liu F, Wenzler L, Seeman N C. Design of self-assembly of two-dimensional crystals.Nature, 1998, 494: 539–544.

    Article  Google Scholar 

  27. Seeman N C. Private Communication.

  28. LaBean T H, Yan H, Kopatsch Jet al. The construction, analysis, ligation and self-assembly of DNA triple crossover complexes.J. Am. Chem. Soc., 2000, 122: 1848–1860.

    Article  Google Scholar 

  29. Adleman L. On constructing a molecular computer. DNA Based Computers.DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, Lipton R, Baum E (Eds.), 27 Providence, RI, American Mathematical Society, 1996, pp.1–21.

    Google Scholar 

  30. Lipton R. DNA solution of hard computational problems.Science, 1995, 268: 542–545.

    Article  Google Scholar 

  31. Adleman L, Rothemund P W K, Roweis Set al. On applying molecular computation to the Data Encryption Standard.DIMACS series in Discrete Math. and Theoretical Comp. Sci., 1999, 44: 31–44.

    MathSciNet  Google Scholar 

  32. Hartmanis J. On the weight of a computation.Bul. EATCS, 1995, 55: 136–138.

    MATH  Google Scholar 

  33. Morimoto N, Arita M, Suyama A. Solid phase DNA solution to the Hamiltonian path problem. DNA Based Computers III, Rubin H, Wood D H (Eds.),DIMACS Series AMS, 1999, 48: 193–206.

    Google Scholar 

  34. Ouyang Q, Kaplan P D, Liu Set al. DNA solution to the Maximal Clique problem.Science, 1997, 278: 446–449.

    Article  Google Scholar 

  35. Faulhammer D, Cukras A R, Lipton R Jet al. Molecular computation: RNA solutions to chess problems. InProc. Natl. Acad. Sci. USA, 2000, 97: 1385–1389.

  36. McCaskill J S, Penchovsky R, Gohlke Met al. Steady flow micro-reactor module for pipelined DNA computations.DNA Computing, Condon A, Rozenberg G (Eds.), LNCS 2054, Springer, 2001, pp.263–270.

  37. van Noort D, Gast F, McCaskill J S. DNA computing in microreactors.DNA Computing, Jonoska N, Seeman N C (Eds.), LNCS 2340, Springer, 2002, pp.31–43.

  38. Penchovsky R, McCaskill J S. Cascadable hybridisation transfer of specific DNA between microreactor selection modules.DNA Computing, Jonoska N, Seeman N C (Eds.), LNCS 2340, Springer, 2002, pp.44–53.

  39. Braich R S, Chelyapov N, Johnson Cet al. Solution of a 20-variable 3-SAT problem on a DNA computer.Science, 2002, 296: 499–502.

    Article  Google Scholar 

  40. Suyama A, Programmable DNA computer. InPreliminary Proceedings of the 8th Int. Meeting on DNA Based Computers, Hokkaido University, June 10–13, 2002, p.91.

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

    Article  Google Scholar 

  42. Hagiya M, Arite M, Kiga Det al. Towards parallel evaluation and learning of Boolean μ-formulas with molecules. DNA Based Computers III, Rubin H, Wood D H (Eds.),DIMACS Series AMS, 1999, 48: 57–72.

    Google Scholar 

  43. Winfree E. Whiplash PCR forO (1) computing. InPreliminary Proceedings of the 4th International Meeting on DNA Based Computers, Kari L, Rubin H, Wood D H (Eds.), University of Pennsylvania, June 15–19, 1998, pp.175–188.

  44. Winfree E, Yang X, Seeman N C. Universal computation via self-assembly of DNA: Some theory and experiments. in [3]Proc. the First Annual Meeting, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 27 Providence RI, American Mathematical Society, 1996.

  45. Wang H. Notes on a class of tiling problems.Fundamenta Mathematicae, 1975, 82: 295–334.

    MATH  Google Scholar 

  46. Rothemund P, Papadakis N, Winfree E. Algorithmic self-assembly of DNA Sierpinsky triangles. InPreliminary Proceedings of the 9th International Meeting on DNA Based Computers, Chen J, Reif J (Eds.), Madison, Wisconsin, June 1–4, 2003, p.125.

  47. Winfree E, Eng T, Rozenberg G. String tile models for DNA computing by self-assembly.DNA Computers, Condon A, Rozenberg G (Eds.), LNCS 2054, Springer, 2001, pp.63–88.

  48. Mao C, LaBean T, Reif J Het al. Logical computation using algorithmic self-assembly of DNA triple crossover molecules.Nature, 2000, 407: 493–496.

    Article  Google Scholar 

  49. Jonoska N, Karl S, Saito M. Three dimensional DNA structures in computing.BioSystems, 1999, 52: 143–153.

    Article  Google Scholar 

  50. Jonoska N, Kari S, Saito M. Creating 3-dimensional graph structures with DNA. in [4]Proc. the First Annual Meeting, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 44 Providence RI, American Mathematical Society, 1998, pp.123–136.

  51. Wasserman S, Cozzarelli N. Biochemical topology: Applications to DNA recombination and replication.Science, 1986, 232: 951–960.

    Article  Google Scholar 

  52. Jonoska N, Saito M. Boundary components of thickened graphs. InRevised Papers of 7th International Meeting on DNA Based Computers, Jonoska N, Seeman N C (Eds.), LNCS 2340, Springer-Verlag, 2002, pp.70–81.

  53. Head T Splicing schemes and DNA. InLindenmayer Systems, Impacts on Theoretical Computer Science and Developmental Biology, Springer-Verlag, 1992, pp.371–383.

  54. Paun Gh. On the power of the splicing operation.Int. J. Computer Math, 1995, 59: 27–35.

    Article  MATH  Google Scholar 

  55. Paun Gh, Rozenberg G, Salomaa A. Computing by splicing.Theoretical Computer Science, 1996, 168(2): 321–336.

    Article  MATH  MathSciNet  Google Scholar 

  56. Ehrenfeucht A, Rozenberg G. Forbidding-enforcing systems.Theoretical Computer Science, 2003, 292: 611–638.

    Article  MATH  MathSciNet  Google Scholar 

  57. van Vugt N. Models of molecular computing [Dissertation]. Leiden University, May 2002.

  58. Filipov D, Jonoska N. The topological space of formal languages and fe-systems. manuscript.

  59. Cavaliere M, Jonoska N. Forbidding and enforcing in membrane computing.J. Natural Computing, 2003, 2: 215–228.

    Article  MATH  MathSciNet  Google Scholar 

  60. Roweis S, Winfree E, Burgoyne Ret al. A sticker based architecture for DNA computation. in [4]Proc. the First Annual Meeting, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 44 Providence RI, American Mathematical Society, 1998, pp.1–27.

  61. Takahara A, Yokomori T. On the computational power of insertion-deletion systems. in [10] InProc. the Eighth Annual Meeting, LNCS 2568, Springer-Verlag, 2002. pp.269–280.

  62. Freund R, Pâun G, Rozenberg G, Salomaa A. Watson-Crick automata. Tech. Report 97-13, Dept. of Computer Science, Leiden Univ. 1997.

  63. Head T, Pixton D, Goode E. Splicing systems: Regularity and below. in [10] InProc. the Eighth Annual Meeting, LNCS 2568, Springer-Verlag, 2002. pp.262–268.

  64. Schützenberger M P. Sur Certaines Opérations de fermeture dans les language rationnels.Symposia Mathematica, 1975, 15: 245–253 (Also inRAIRO Information Theory, 1974, 1: 55–61).

    Google Scholar 

  65. de Luca A, Restivo A. A characterization of strictly locally testable languages and its applications to subsemigroups of a free semigroup.Information and Control, 1980, 44: 300–319.

    Article  MATH  MathSciNet  Google Scholar 

  66. Yurke B, Turberfield A J, Mills A Pet al. A DNA fueled molecular machine made of DNA.Nature, 2000, 406: 605–608.

    Article  Google Scholar 

  67. Simmel F C, Yurke B. Operation of a purified DNA nanoactuator. in [9] InProc. the Seventh Annual Meeting, LNCS 2340, Springer-Verlag, 2002. pp.248–257.

  68. Simmel F C, Yurke B. Using DNA to construct and power a nanoactuator.Phys. Rev. E., 2001, 63(041913): 1–5.

    Google Scholar 

  69. Yan H, Zhang X, Shen Z, Seeman N C. A robust DNA mechanical device controlled by hybridization topology.Nature, 2002, 415: 62–65.

    Article  Google Scholar 

  70. Seeman N C. DNA in a material world.Nature, 2003, 421(6921): 427–431.

    Article  MathSciNet  Google Scholar 

  71. Benenson Y, Paz-elizur T, Adar Ret al. Programmable and autonomous machine made of biomolecules.Nature, 2001, 414: 430–434.

    Article  Google Scholar 

  72. Benenson Y, Adar R, Paz-elizur Tet al. Molecular computing machine uses information as fuel. InPreliminary Proceedings of the 8th Int. Meeting on DNA Based Computers, Hokkaido University, June 10–13, 2002, p.198.

  73. Hussini S, Kari L, Konstantinidis S. Coding properties of DNA languages.DNA Computing: Proceedings of the 7th International Meeting on DNA Based Computers, Jonoska N, Seeman N C (Eds.), LNCS 2340, Springer, 2002, pp.57–69.

  74. Mahalingam K, Jonoska N, Languages of DNA based code words. InPreliminary Proceedings of the 9th International Meeting on DNA Based Computers, Chen J, Reif J, (Eds.), Madison, Wisconsin, June 1–4, 2003, pp.58–68.

  75. Garzon M, Deaton R, Reanult D. Virtual test tubes: A new methodology for computing. InProc. 7th. Int. Symp. String Processing and Information retrieval, A Coruňa, Spain. IEEE Computing Society Press, 2000, pp.116–121.

    Google Scholar 

  76. Seeman N C. De Novo design of sequences for nucleic acid structural engineering.J. of Biomolecular Structure & Dynamics, 1990, 8(3): 573–581.

    Google Scholar 

  77. Feldkamp U, Saghafi S, Rauhe H. DNA Sequence Generator — A program for the construction of DNA sequences.DNA Computing, Jonoska N, Seeman N C (Eds.), LNCS 2340, Springer, 2002, pp.23–32.

  78. Deaton R, Chen J, Bi Het al. A PCR-based protocol for In Vitro selection of non-crosshybridizing oligonucleotides. in [10] InProc. the Eighth Annual Meeting, LNCS 2568, Springer-Verlag, 2002. pp.196–204.

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of South Florida, 33620, Tampa, FL, U.S.A.

    Nataša Jonoska

Authors
  1. Nataša Jonoska
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nataša Jonoska.

Additional information

This work has been partially supported by the National Science Foundation of USA under Grants No.EIA-0086015 and No.EIA-0074808.

Nataša Jonoska received the B.S. degree in mathematics and computer science in 1984 from Univerity, of Cyril & Methodius in Skopje, Macedonia. She obtained a Ph.D. degree in mathematical sciences from the State University of New York in Binghamton in 1993 and joined the faculty at the University of South Florida (USF) the same year. Now she is an associate professor in mathematics at USF and her research includes formal language theory, biomolecular computation, and symbolic dynamics. She organized the 7th International Meeting on DNA Based Computers and has served on the Program Committee of this conference for several years.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jonoska, N. Trends in computing with DNA. J. Comput. Sci. & Technol. 19, 98–113 (2004). https://doi.org/10.1007/BF02944788

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02944788

Keywords

Search

Navigation