Abstract
This paper addresses two main aspects of DNA computing research: DNA computing in vitro and in vivo. We first present a model of DNA computation developed in [5]: the circular insertion/deletion system. We review the result obtained in [5] stating that this system has the computational power of a Turing machine, and present the outcome of a molecular biologylab oratoryex periment from [5] that implements a small instance of such a system. This shows that rewriting systems of the circular insertion/deletion type are viable alternatives in DNA computation in vitro. In the second half of the paper we address DNA computing in vivo by presenting a model proposed in [17] and developed in [18] for the homologous recombinations that take place during gene rearrangement in ciliates. Such a model has universal computational power which indicates that, in principle, some unicellular organisms may have the capacity to perform any computation carried out by an electronic computer.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
L. Adleman. Molecular computation of solutions to combinatorial problems. Science v.266, Nov.1994, 1021–1024. 269, 270, 270, 277
L. Adleman. On constructing a molecular computer. 1st DIMACS workshop on DNA based computers, Princeton, 1995. In DIMACS series, vol.27 (1996), 1–21. 270
E. Baum. Building an associative memoryv astlylarger than the brain. Science, vol.268, April 1995, 583–585. 270
E. Csuhaj-Varju, R. Freund, L. Kari, and G. Păun. DNA computing based on splicing: universalityresu lts. In Hunter, L. and T. Klein (editors). Proceedings of 1st Pacific Symposium on Biocomputing. World Scientific Publ., Singapore, 1996, 179-190. 279
M. Daley, L. Kari, G. Gloor, R. Siromoney. Circular contextual insertions/deletions with applications to biomolecular computation. Proceedings of String Processing and Information REtrieval’ 99, Mexico, IEEE CS Press, 1999, in press. 269, 269, 269, 270, 272, 272, 272, 273, 273, 273, 274, 274, 275
S. Eilenberg. Automata, Languages and Machines. Academic Press, New York, 1984. 279
T. Head. Formal language theoryan d DNA: an analysis of the generative capacity of recombinant behaviors. Bulletin of Mathematical Biology, 49(1987), 737–759. 278, 279
T. Head. Splicing schemes and DNA. Lindenmayer systems, G. Rozenberg and A. Salomaa eds., Springer Verlag, Berlin, 1991, 371–383. 272, 278, 279
T. Head, G. Păun, D. Pixton. Language theoryan d genetics. Generative mechanisms suggested by DNA recombination. In Handbook of Formal Languages (G. Rozenberg, A. Salomaa eds.), Springer Verlag, 1996. 272
D.C. Hoffman, and D.M. Prescott. Evolution of internal eliminated segments and scrambling in the micronuclear gene encoding DNA polymerase α in two Oxytricha species. Nucl. Acids Res. 25(1997), 1883–1889. 277
L. Kari. On insertions and deletions in formal languages. Ph.D. thesis, University of Turku, Finland, 1991. 272
L. Kari. DNA computing: arrival of biological mathematics. The Mathematical Intelligencer, vol.19, nr.2, Spring 1997, 9–22. 270, 271, 271
L. Kari. From Micro-Soft to Bio-Soft: Computing with DNA. Proceedings of BCEC’97 (Bio-Computing and Emergent Computation) Skovde, Sweden, World Scientific Publishing Co., 146–164.
L. Kari, L.F. Landweber. Computational power of gene rearrangement. Proceedings of DNA Based Computers V, E. Winfree, D. Gifford eds., MIT, Boston, June 1999, 203-213. 278
L. Kari, G. Thierrin. Contextual insertions/deletions and computability. Information and Computation, 131, no.1 (1996), 47–61. 272, 278
J. Kendrew et al., eds. The Encyclopedia of Molecular Biology, Blackwell Science, Oxford, 1994. 271
L.F. Landweber, L. Kari. The evolution of cellular computing: nature’s solution to a computational problem. Proceedings of 4th DIMACS meeting on DNA based computers, Philadephia, 1998, 3–15. 269, 270, 276, 277, 278, 279, 280, 281
L.F. Landweber, L. Kari. Universal molecular computation in ciliates. In Evolution as Computation, L.F. Landweber, E, Winfree, Eds., Springer Verlag, 1999. 269, 270, 276, 278, 279, 279, 280, 280, 280, 280, 280
E. Meyer,and S. Duharcourt. Epigenetic Programming of Developmental Genome Rearrangements in Ciliates. Cell (1996) 87, 9–12. 278
G. Păun. On the power of the splicing operation. Int. J. Comp. Math 59(1995), 27–35. 279
D. Pixton. Linear and circular splicing systems. Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems, IEEE Computer SocietyPress, Los Alamos, 1995, 181–188. 272, 279
G. Rozenberg, and A. Salomaa eds. Handbook of Formal Languages, Springer Verlag, Berlin, 1997. 272, 279
A. Salomaa. Formal Languages. Academic Press, New York, 1973. 272, 273
R. Siromoney, K.G. Subramanian and Dare Rajkumar, Circular DNA and splicing systems. In Parallel Image Analysis. Lecture Notes in Computer Science 654, Springer Verlag, Berlin, 1992, 260–273. 272, 279
T. Yokomori, S. Kobayashi and C. Ferretti. Circular splicing systems and DNA computability Proc. of IEEE International Conference on Evolutionary Computation’ 97, 1997, 219–224. 272, 279
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
Kari, L., Daley, M., Gloor, G., Siromoney, R., Landweber, L.F. (1999). How to Compute with DNA. In: Rangan, C.P., Raman, V., Ramanujam, R. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1999. Lecture Notes in Computer Science, vol 1738. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46691-6_21
Download citation
DOI: https://doi.org/10.1007/3-540-46691-6_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66836-7
Online ISBN: 978-3-540-46691-8
eBook Packages: Springer Book Archive