Splicing Systems, Aqueous Computing, and Beyond

The origin of the splicing system concept is reviewed and the original motivation for the concept is given. The concept of an aqueous computing architecture is sketched in a manner independent of specific implementations. Wet lab computations made using biomolecular implementations are reported. Hopes for future non-biomolecular realizations are confided.

[1]  A. Lindenmayer.  Mathematical models for cellular interactions in development. II. Simple and branching filaments with two-sided inputs. , 1968, Journal of theoretical biology.

[2]  Satoshi Kobayashi,et al.  On the power of circular splicing systems and DNA computability , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

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

[4]  R. W. Gatterdam.  Splicing systems and regularity , 1989 .

[5]  P D Kaplan,et al.  DNA solution of the maximal clique problem. , 1997, Science.

[6]  G Rozenberg,et al.  Computing with DNA by operating on plasmids. , 2000, Bio Systems.

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

[8]  榊原 康文,et al.  G. Paun, G. Rozenberg and A. Salomaa : "DNA Computing-New Computing Paradigms", Springer-Verlag (1998) , 2000 .

[9]  Przemyslaw Prusinkiewicz,et al.  The Algorithmic Beauty of Plants , 1990, The Virtual Laboratory.

[10]  Tom Head.  Writing by methylation proposed for aqueous computing , 2001, Where Mathematics, Computer Science, Linguistics and Biology Meet.

[11]  Antonio Restivo,et al.  A Characterization of Strictly Locally Testable Languages and Its Applications to Subsemigroups of a Free Semigroup , 1980, Inf. Control..

[12]  T. Head,et al.  Aqueous computing: writing on molecules , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

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

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

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

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

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

[18]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[19]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[21]  L F Landweber,et al.  Molecular computation: RNA solutions to chess problems , 2000, Proc. Natl. Acad. Sci. USA.

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

[23]  Rani Siromoney,et al.  Circular DNA and Splicing Systems , 1992, ICPIA.

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

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

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

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

[28]  R. W. Gatterdam.  Algorithms for Splicing Systems , 1992, SIAM J. Comput..

[29]  A. Lindenmayer.  Mathematical models for cellular interactions in development. I. Filaments with one-sided inputs. , 1968, Journal of theoretical biology.

[30]  Tom Head.  CIRCULAR SUGGESTIONS FOR DNA COMPUTING , 2000 .