DNA Computing: New Ideas and Paradigms

  • Grzegorz Rozenberg
  • Arto Salomaa
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1644)


DNA computing is one of the most exciting new developments in computer science, from both technological and theoretical point of view. We begin by observing how the structure of DNA molecules and the technics available for manipulating them are very suitable for computing. We then establish a link with certain fairly old results from computability theory which essentially explain why the main feature of DNA molecules, the Watson-Crick complementarity, gives rise to the Turing-universality of DNA computations. Selected areas of DNA computing, interesting from a theoretical point of view but offering also practical potential, will be briefly examined.


Turing Machine Single Strand Regular Language Massive Parallelism Enumerable Language 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    L.M. Adleman, Molecular computation of solutions to combinatorial problems, Science 226 1021–1024.Google Scholar
  2. 2.
    J. Engelfriet, G. Rozenberg, Fixed point languages, equality languages, and representations of recursively enumerable languages, J. Assoc. Comput. Mach. 27 (1980) 499–518.zbMATHMathSciNetGoogle Scholar
  3. 3.
    R.J. Lipton, E.B. Baum, eds., DNA Based Computers, Proc. of the DIMACS Workshop, Princeton, 1995, Amer. Math. Soc., 1996.Google Scholar
  4. 4.
    V. Mihalache, A. Salomaa, Language-theoretic aspects of DNA complementarity, Theoret. Comput. Sci., to appear.Google Scholar
  5. 5.
    Gh. Păun, G. Rozenberg, A. Salomaa, DNA Computing. New Computing Paradigms, Springer-Verlag, Berlin, Heidelberg, 1998.zbMATHGoogle Scholar
  6. 6.
    G. Rozenberg, A. Salomaa, The Mathematical Theory of L Systems, Academic Press, New-York, 1980.zbMATHGoogle Scholar
  7. 7.
    A. Salomaa, Jewels of Formal Language Theory, Computer Science Press, Rockville, Md., 1981.Google Scholar
  8. 8.
    A. Salomaa, Watson-Crick walks and roads in D0L graphs, Acta Cybernetica, to appear.Google Scholar
  9. 9.
    B.A. Trakhtenbrot, A survey of Russian approaches to perebor algorithms, Ann. Hist. Comput. 6 (1984) 384–400.zbMATHMathSciNetCrossRefGoogle Scholar
  10. 10.
    B.A. Trakhtenbrot, From logic to theoretical computer science, in C. Calude, ed., People and Ideas in Theoretical Computer Science, Springer-Verlag, Berlin, 1999, 314–341.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Grzegorz Rozenberg
    • 1
    • 2
  • Arto Salomaa
    • 3
    • 2
  1. 1.Leiden Institute of Advanced Computer Science (LIACS)Leiden UniversityLeidenThe Netherlands
  2. 2.Department of Computer ScienceUniversity of ColoradoBoulderUSA
  3. 3.Turku Centre for Computer ScienceTurkuFinland

Personalised recommendations