Wet splicing systems

Splicing systems were originally developed as a mathematical or dry model of the generative capacity of DNA molecules in the presence of appropriate enzymes. The accuracy with which the model predicts the behavior of the corresponding biological or wet splicing system is investigated. A simple example of a wet splicing system is shown to generate in vitro the splicing language predicted by the corresponding dry splicing system.

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

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

[3]  L. Karl.  DNA computing: Arrival of biological mathematics , 1997 .

[4]  E. Csuhaj-Varjú,et al.  Test tube systems with cutting/recombination operations. , 1997, Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing.

[5]  N. Jonoska,et al.  Ligation experiments in computing with DNA , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

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

[7]  Rudolf Freund,et al.  DNA Computing Based on Splicing: The Existence of Universal Computers , 1999, Theory of Computing Systems.

[8]  G. Paun.  The splicing as an operation on formal languages , 1995, Proceedings First International Symposium on Intelligence in Neural and Biological Systems. INBS'95.

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

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

[11]  M AdlemanLeonard.  Molecular computation of solutions to combinatorial problems , 1994 .

[12]  Richard J. Lipton,et al.  Breaking DES using a molecular computer , 1995, DNA Based Computers.