Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
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 226 1021–1024.
J. Engelfriet, G. Rozenberg, Fixed point languages, equality languages, and representations of recursively enumerable languages, J. Assoc. Comput. Mach.27 (1980) 499–518.
R.J. Lipton, E.B. Baum, eds., DNA Based Computers, Proc. of the DIMACS Workshop, Princeton, 1995, Amer. Math. Soc., 1996.
V. Mihalache, A. Salomaa, Language-theoretic aspects of DNA complementarity, Theoret. Comput. Sci., to appear.
Gh. Păun, G. Rozenberg, A. Salomaa, DNA Computing. New Computing Paradigms, Springer-Verlag, Berlin, Heidelberg, 1998.
G. Rozenberg, A. Salomaa, The Mathematical Theory of L Systems, Academic Press, New-York, 1980.
A. Salomaa, Jewels of Formal Language Theory, Computer Science Press, Rockville, Md., 1981.
A. Salomaa, Watson-Crick walks and roads in D0L graphs, Acta Cybernetica, to appear.
B.A. Trakhtenbrot, A survey of Russian approaches to perebor algorithms, Ann. Hist. Comput. 6 (1984) 384–400.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rozenberg, G., Salomaa, A. (1999). DNA Computing: New Ideas and Paradigms. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds) Automata, Languages and Programming. Lecture Notes in Computer Science, vol 1644. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48523-6_9
Download citation
DOI: https://doi.org/10.1007/3-540-48523-6_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66224-2
Online ISBN: 978-3-540-48523-0
eBook Packages: Springer Book Archive