Topics in the theory of DNA computing

DNA computing, or, more generally, molecular computing, is an exciting fast developing interdisciplinary area. Research in this area concerns theory, experiments, and applications of DNA computing. In this paper, we demonstrate the theoretical developments by discussing a number of selected topics. We also give an introduction to the basic structure of DNA and the basic DNA processing tools.

[1]  Maurice Margenstern,et al.  A universal time-varying distributed H-system of degree 2 , 1999 .

[2]  Victor Mitrana,et al.  Splicing Grammar Systems , 1996, Comput. Artif. Intell..

[3]  Joost Engelfriet,et al.  Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages , 1980, JACM.

[4]  S. Grimwade.  Recombinant DNA , 1977, Nature.

[5]  Lynn Conway,et al.  Introduction to VLSI systems , 1978 .

[6]  Maurice Margenstern,et al.  Time-varying distributd H-systems of degree 2 generate all recursively enumerable languages , 2001, Where Mathematics, Computer Science, Linguistics and Biology Meet.

[7]  R Rusting,et al.  Safe passage? Study fuels debate over safety of birth centers. , 1990, Scientific American.

[8]  H.R.V. Arnstein.  The biochemistry of the nucleic acids, 10th edition : by R.L.P. Adams, J.T. Knowler and D.P. Leader Chapman and Hall; London, New York, 1986 xviii + 526 pages. £35.00 (hardback), £16.95 (paperback) , 1987 .

[9]  L M Adleman,et al.  Molecular computation of solutions to combinatorial problems. , 1994, Science.

[10]  T. Head.  Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. , 1987, Bulletin of mathematical biology.

[11]  Gheorghe Paun,et al.  DNA Computing: New Computing Paradigms , 1998 .

[12]  Gheorghe Paun,et al.  DNA Computing: Distributed Splicing Systems , 1997, Structures in Logic and Computer Science.

[13]  Grzegorz Rozenberg,et al.  DNA Computing: New Ideas and Paradigms , 1999, ICALP.

[14]  Neil Weste,et al.  Principles of CMOS VLSI Design , 1985 .

[15]  Sandy B. Primrose,et al.  Principles of gene manipulation: An introduction to genetic engineering , 1980 .

[16]  B. A. Bernstein.  A set of four independent postulates for Boolean algebras , 1916 .

[17]  K. Drlica.  Understanding DNA and gene cloning: a guide for the curious. , 1992 .

[18]  Gheorghe Paun,et al.  Regulated Rewriting in Formal Language Theory , 1989 .

[19]  J. Sambrook,et al.  Molecular Cloning: A Laboratory Manual , 2001 .

[20]  Jennifer Seberry,et al.  Public Key Cryptography , 2000, Lecture Notes in Computer Science.

[21]  Arto Salomaa.  Jewels of formal language theory , 1981 .

[22]  Andrzej Ehrenfeucht,et al.  Forbidding and enforcing , 1999, DNA Based Computers.

[23]  Dennis Pixton,et al.  Regularity of Splicing Languages , 1996, Discret. Appl. Math..

[24]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[25]  Giancarlo Mauri,et al.  Nine Test Tubes Generate any RE Language , 1998, MCU.

[26]  Ingo Wegener,et al.  The complexity of Boolean functions , 1987 .

[27]  Erzsébet Csuhaj-Varjú,et al.  Test Tube Distributed Systems Based on Splicing , 1996, Comput. Artif. Intell..

[28]  Mitsunori Ogihara,et al.  Simulating Boolean circuits on a DNA computer , 1997, RECOMB '97.

[29]  Martyn Amos,et al.  The Complexity and Viability of DNA Computations , 1997, BCEC.

[30]  David I. Lewin,et al.  DNA computing , 2002, Comput. Sci. Eng..

[31]  Gheorghe Paun.  Two-Level Distributed H Systems , 1997, Developments in Language Theory.

[32]  Martyn Amos,et al.  DNA simulation of boolean circuits , 1998 .

[33]  Maurice Margenstern,et al.  A Universal Time-Varying Distributed H System of Degree 1 , 2001, DNA.

[34]  K. Mullis.  The unusual origin of the polymerase chain reaction. , 1990, Scientific American.

[35]  Andrzej Ehrenfeucht,et al.  Forbidding-enforcing systems , 2003, Theor. Comput. Sci..

[36]  Gheorghe Paun,et al.  Computing by Splicing , 1996, Theor. Comput. Sci..

[37]  Dennis Pixton,et al.  Splicing in abstract families of languages , 2000, Theor. Comput. Sci..

[38]  Henry M. Sheffer.  A set of five independent postulates for Boolean algebras, with application to logical constants , 1913 .

[39]  K. Drlica.  Understanding DNA and gene cloning , 1984 .

[40]  Gheorghe Paun,et al.  A guide to membrane computing , 2002, Theor. Comput. Sci..

[41]  Gheorghe Paun,et al.  Computing with Membranes , 2000, J. Comput. Syst. Sci..

[42]  Carlos Martín-Vide,et al.  Cooperating Distributed Splicing Systems , 1999, J. Autom. Lang. Comb..

[43]  Andrzej Ehrenfeucht,et al.  Sequences of languages in forbidding–enforcing families , 2001, Soft Comput..

[44]  Arto Salomaa,et al.  Formal languages , 1973, Computer science classics.

[45]  Grzegorz Rozenberg,et al.  Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht , 1997 .

[46]  Gheorghe Paun,et al.  Regular Extended H Systems are Computationally Universal , 1996, J. Autom. Lang. Comb..

[47]  J Watson,et al.  Genetic engineering. , 1985, The Lamp.

[48]  Gheorghe Paun,et al.  Words, Semigroups, and Transductions , 2001 .

[49]  Giancarlo Mauri,et al.  A Reduced Distributed Splicing System for RE Languages , 1997, New Trends in Formal Languages.

[50]  J. van Leeuwen,et al.  Theoretical Computer Science , 2003, Lecture Notes in Computer Science.

[51]  Gheorghe Paun,et al.  Grammar Systems: A Grammatical Approach to Distribution and Cooperation , 1995, ICALP.

[52]  John H. Reif,et al.  DNA-based Cryptography , 1999, Aspects of Molecular Computing.

[53]  Gheorghe Paun,et al.  Simulation Algorithms for Computational Systems Biology , 2017, Texts in Theoretical Computer Science. An EATCS Series.

[54]  Andrei Paun.  On Time-Varying H Systems , 1999, Bull. EATCS.

[55]  John L. Casti,et al.  Unconventional Models of Computation , 2002, Lecture Notes in Computer Science.

[56]  염흥렬,et al.  [서평]「Applied Cryptography」 , 1997 .

[57]  Henry A. Erlich,et al.  The polymerase chain reaction. , 1989, Trends in genetics : TIG.

[58]  Paul E. Dunne,et al.  The Complexity of Boolean Networks , 1988 .

[59]  Grzegorz Rozenberg,et al.  The mathematical theory of L systems , 1980 .

[60]  H. Blöcker,et al.  Predicting DNA duplex stability from the base sequence. , 1986, Proceedings of the National Academy of Sciences of the United States of America.

[61]  Michael A. Harrison,et al.  Introduction to switching and automata theory , 1965 .

[62]  Tom Head,et al.  Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors , 1987 .

[63]  Marilena Barnabei,et al.  Some properties of characteristic polynomials and applications to T-lattices , 1991, Discret. Math..

[64]  Tero Harju,et al.  Splicing semigroups of dominoes and DNA , 1991, Discret. Appl. Math..

[65]  Gheorghe Paun,et al.  DNA computing based on splicing: universality results. , 1996, Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing.

[66]  A. Salomaa.  Turing, Watson-Crick and Lindenmayer. Aspects of DNA Complementarity , 1997 .