String Processing and Information Retrieval, International Symposium on (1999)
Sept. 21, 1999 to Sept. 24, 1999
Mark Daley , University of Western Ontario
Lila Kari , University of Western Ontario
Greg Gloor , University of Western Ontario
Rani Siromoney , Madras Christian College
Insertions and deletions of small circular DNA strands into long linear DNA strands are phenomena that happen frequently in nature and thus constitute an attractive paradigm for biomolecular computing. This paper presents a new model for DNA-based computation that involves circula r as well as linear molecules, and that uses the operations of insertion and deletion. After intro ducing the formal model we investigate its properties and prove in particular that the circular insertion/deletion systems are capable of universal computation. We also give the results of an experimental laboratory implementation of our model. This shows that rewriting systems of the circular insertion/deletion type are viable alternatives in DNA computation.
M. Daley, G. Gloor, R. Siromoney and L. Kari, "Circular Contextual Insertions/Deletions with Applications to Biomolecular Computation," String Processing and Information Retrieval, International Symposium on(SPIRE), Cancun, Mexico, 1999, pp. 47.