Abstract not found

From a biological motivation of interactions between linear and circular DNA sequences, we propose a new type of splicing models called circular H systems and show that they have the same computational power as Turing machines. It is also shown that there effectively exists a universal circular H system which can simulate any circular H system with the same terminal alphabet, which strongly suggests a feasible design for a DNA computer based on circular splicing. 1 Introduction Since Adleman's breath-taking paper on molecular (DNA) computing ([1]), there have already been quite a few papers on this challenging topic : [10] shows how to solve NP-complete problems using DNA, while [3] discusses a design method for simulating a Turing machine by molecular biological techniques and shows how to compute PSPACE, and [4]) gives a methodology for breaking the DES using techniques in genetic engineering. In response to the rapid stream of experimental research on this new computation paradigm...

The relationship between the family SH of simple splicing languages, which was recently introduced by A. Mateescu and coauthors, and the family SLT of strictly locally testable languages is clarified by establishing an ascending hierarchy of families fS i H : i \Gamma1g of splicing languages for which SH = S1H and the union of the families is the family SLT . A procedure is given which, for an arbitrary regular language L, determines whether L is in SLT and, when L is in SLT , specifies constructively the smallest family in the hierarchy to which L belongs. Examples are given of sets of restriction enzymes for which the action on DNA molecules is naturally represented by splicing systems of the types discussed. Key words. Splicing systems, H Systems, DNA Computing, local testability, regular languages, restriction enzymes 1 Introduction The splicing system concept was introduced in [6] as a formal device for the generation of languages and as a formal model of specific forms ...

In search for a universal splicing system, in this paper we present a Post system universal for the class of Post systems, and we discuss its translation into an extended splicing system with multiplicity. We also discuss the complexity of the resulting universal splicing system, comparing our result with recent known results about the translation of universal Turing machines into splicing systems. 1 Introduction Since the possibility of molecular computing was shown by Adleman's pioneering work ([1]) which, in a test tube, experimentally solves a small instance of an NPcomplete problem, the theoretical formalization of such a new computing technology has been attracting much attention in computer science ([3][5][6][12][17]). One of the formal frameworks for molecular computations is the Tom Head's splicing system ( or H system ), which gives a theoretical foundation for computing based on DNA recombination. Tom Head's seminal work ([9]) on modeling DNA recombination as a splicing sys...