DNA Computing Based on Splicing: The Existence of Universal Computers

Abstract. We prove that splicingsystems with finite components and certain controls on their work are computationallycomplete (they can simulate any Turing Machine); moreover, there are universalsplicingsystems (systems with all components fixed which can simulate any given splicing system, when an encoding of the particular system is added—as a program—to the universal system). Splicing systems are based on the splicingoperation which is a model for DNA recombination. Informally, a prefix of a word is catenated to a suffix of another word, thus yielding a (possibly) new word. Cutting occurs at specific sites which correspond to specific sequences in DNA strands as they can be recognized by restriction enzymes. When no additional control is assumed, splicing systems with finitely many starting words (axioms) and finitely many splicing rules are known to characterize only regular languages (those recognized by finiteautomata ). However, when a splicing rule is allowed to be used (1)\hskip .5em only in the presence of certain symbols (``catalyst'') or (2)\hskip .5em only in the absence of certain symbols (``inhibitors''), then we can characterize the recursively enumerable languages (recognized by TuringMachines ); the same result is obtained when counting the number of copies of (some of) the words used. From the proofs, we also infer the existence of universal (hence programmable) splicing systems.

[1]  Wen-Hsiung Li,et al.  Fundamentals of molecular evolution , 1990 .

[2]  D. Pixton.  Linear and circular splicing systems , 1995, Proceedings First International Symposium on Intelligence in Neural and Biological Systems. INBS'95.

[3]  R J Lipton,et al.  DNA solution of hard computational problems. , 1995, Science.

[4]  M. Minsky.  Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines , 1961 .

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

[6]  David B. Searls,et al.  The computational linguistics of biological sequences , 1993, ISMB 1995.

[7]  Takashi Yokomori,et al.  DNA evolutionary linguistics and RNA structure modeling: a computational approach , 1995, Proceedings First International Symposium on Intelligence in Neural and Biological Systems. INBS'95.

[8]  Martin Davis.  Review: Marvin L. Minsky, Recursive Unsolvability of Post's Problem of "Tag" and other Topics in the Theory of Turing Machines , 1966 .

[9]  Richard J. Lipton,et al.  Speeding up computations via molecular biology , 1995, DNA Based Computers.

[10]  Gheorghe Paun,et al.  On the Splicing Operation , 1996, Discret. Appl. Math..

[11]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

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

[13]  Gheorghe Paun,et al.  Language Theory and Molecular Genetics: Generative Mechanisms Suggested by DNA Recombination , 1997, Handbook of Formal Languages.

[14]  Gheorghe Paun,et al.  Simple Splicing Systems , 1998, Discret. Appl. Math..

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

[16]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[17]  Anders Krogh,et al.  Introduction to the theory of neural computation , 1994, The advanced book program.

[18]  Lawrence Hunter,et al.  Molecular biology for computer scientists , 1993 .

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

[20]  Nadrian C. Seeman,et al.  A solid-support methodology for the construction of geometrical objects from DNA , 1992 .

[21]  Michael A. Arbib,et al.  An Introduction to Formal Language Theory , 1988, Texts and Monographs in Computer Science.

[22]  Cristian S. Calude,et al.  Global syntax and semantics for recursively enumerable languages , 1981, Fundam. Informaticae.

[23]  A. Church.  Review: A. M. Turing, On Computable Numbers, with an Application to the Entscheidungsproblem , 1937 .

[24]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

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

[26]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

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

[28]  R. W. Gatterdam,et al.  On the undecidability of splicing systems , 1989 .

[29]  P. Bonizzoni,et al.  Linear and circular splicing , 1999 .

[30]  Gheorghe Paun.  Splicing: A Challenge for Formal Language Theorists , 2001, Current Trends in Theoretical Computer Science.

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

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

[33]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

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

[35]  D K Gifford,et al.  On the path to computation with DNA. , 1994, Science.

[36]  Gheorghe Paun,et al.  DNA COMPUTING BASED ON THE SPLICING OPERATION , 1996 .

[37]  Gheorghe Paun,et al.  On the power of the splicing operation , 1995, Int. J. Comput. Math..