## On the Power of Circular Splicing Systems and DNA Computability (1997)

Venue: | Proc. of IEEE Intern. Conf. on Evol. Comput. (ICEC'97 |

Citations: | 22 - 5 self |

### BibTeX

@INPROCEEDINGS{Yokomori97onthe,

author = {Takashi Yokomori and Satoshi Kobayashi and Claudio Ferretti},

title = {On the Power of Circular Splicing Systems and DNA Computability},

booktitle = {Proc. of IEEE Intern. Conf. on Evol. Comput. (ICEC'97},

year = {1997},

pages = {219--224}

}

### Years of Citing Articles

### OpenURL

### Abstract

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...

### Citations

689 | Molecular computation of solutions to combinatorial problems
- Adleman
- 1994
(Show Context)
Citation Context ...h 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... |

345 | Introduction to Formal Language Theory - Harrison - 1978 |

206 |
Formal language theory and dna: An analysis of the generative capacity of specic recombinant behaviors
- Head
- 1987
(Show Context)
Citation Context ...omputing has lately been attracting much attention in computer science, which has been originated by Head's work on splicing systems (or H systems) and their languages for modeling DNA recombination (=-=[8]-=-). Those discuss a variety of topics including the regularity of splicing DNA languages, the language-theoretic properties of circular DNA languages ([9, 15, 19]), and the universal computability of e... |

94 |
Formal Reduction of the General Combinatorial Decision
- Post
- 1943
(Show Context)
Citation Context ...the empty string . Throughout this paper, we assume that any language is -free. The family of recursively enumerable languages is denoted by RE . We will introduce Post systems originally proposed in =-=[16]-=- but here we are only concerned with their special forms, because it is sufficient for our purpose. A Post Normal system (PN system) is a quadruple G = (V; 6; P; A), where V and 6 are finite alphabets... |

82 | A DNA and restriction enzyme implementation of Turing machines
- Rothemund
- 1998
(Show Context)
Citation Context ...ize it. This observation also suggests the high feasibility of a universal CH system. Finally, as for the DNA implementation of rotation operation, one can find some detailed discussion in [2], while =-=[17]-=- discusses the DNA and restriction enzyme implementation of Turing machines. Acknowledgements This work was supported in part by Grant No. JSPS-RFTF 96I00101 from Research-for-the-Future Program of th... |

60 | Breaking DES using a molecular computer
- Boneh, Dunworth, et al.
- 1995
(Show Context)
Citation Context ...c : [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, a series of papers on the... |

55 |
On the power of the splicing operation
- Paun
- 1995
(Show Context)
Citation Context ... including the regularity of splicing DNA languages, the language-theoretic properties of circular DNA languages ([9, 15, 19]), and the universal computability of extended models of splicing systems (=-=[11, 12, 13, 14]-=-). Among others, [6] shows the existence of a universal extended splicing system which can simulate the behavior of any other extended splicing system. In this paper, we introduce a new type of splici... |

55 |
Theory of Automata
- Salomaa
- 1969
(Show Context)
Citation Context ...is denoted by =) 3 . For a given G, a language generated by G is defined as L(G) = fw 2 6 3 j9u 2 A [u =) 3 w]g: By POST , we denote the family of languages generated by Post Normal systems. Lemma 1 (=-=[18]-=-) POST = RE : In order to prove our first result, we need some more preliminary results about Post systems. A generalized regular Post system (GRP system) is a quadruple G = (V; 6; P; A), where V and ... |

53 | Using DNA to solve NP-complete problems - Lipton |

52 | A universal molecular computer
- Beaver
- 1995
(Show Context)
Citation Context ... 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 gen... |

46 | Regularity of splicing languages
- Pixton
- 1996
(Show Context)
Citation Context ...heir languages for modeling DNA recombination ([8]). Those discuss a variety of topics including the regularity of splicing DNA languages, the language-theoretic properties of circular DNA languages (=-=[9, 15, 19]-=-), and the universal computability of extended models of splicing systems ([11, 12, 13, 14]). Among others, [6] shows the existence of a universal extended splicing system which can simulate the behav... |

41 |
Regular extended H systems are computationally universal
- Paun
- 1996
(Show Context)
Citation Context ... including the regularity of splicing DNA languages, the language-theoretic properties of circular DNA languages ([9, 15, 19]), and the universal computability of extended models of splicing systems (=-=[11, 12, 13, 14]-=-). Among others, [6] shows the existence of a universal extended splicing system which can simulate the behavior of any other extended splicing system. In this paper, we introduce a new type of splici... |

25 |
Computing by splicing
- Paun, Salomaa
- 1996
(Show Context)
Citation Context ... including the regularity of splicing DNA languages, the language-theoretic properties of circular DNA languages ([9, 15, 19]), and the universal computability of extended models of splicing systems (=-=[11, 12, 13, 14]-=-). Among others, [6] shows the existence of a universal extended splicing system which can simulate the behavior of any other extended splicing system. In this paper, we introduce a new type of splici... |

24 |
Splicing schemes and DNA
- Head
- 1992
(Show Context)
Citation Context ...heir languages for modeling DNA recombination ([8]). Those discuss a variety of topics including the regularity of splicing DNA languages, the language-theoretic properties of circular DNA languages (=-=[9, 15, 19]-=-), and the universal computability of extended models of splicing systems ([11, 12, 13, 14]). Among others, [6] shows the existence of a universal extended splicing system which can simulate the behav... |

22 |
DNA computing based on splicing: the existence of universal computers
- Păun
(Show Context)
Citation Context ...cing DNA languages, the language-theoretic properties of circular DNA languages ([9, 15, 19]), and the universal computability of extended models of splicing systems ([11, 12, 13, 14]). Among others, =-=[6]-=- shows the existence of a universal extended splicing system which can simulate the behavior of any other extended splicing system. In this paper, we introduce a new type of splicing operations to pro... |

18 |
Circular DNA and splicing systems
- Siromoney, Subramanian, et al.
- 1992
(Show Context)
Citation Context ...heir languages for modeling DNA recombination ([8]). Those discuss a variety of topics including the regularity of splicing DNA languages, the language-theoretic properties of circular DNA languages (=-=[9, 15, 19]-=-), and the universal computability of extended models of splicing systems ([11, 12, 13, 14]). Among others, [6] shows the existence of a universal extended splicing system which can simulate the behav... |

17 | Joining and rotating data with molecules
- Arita, Hagiya, et al.
(Show Context)
Citation Context ...res to realize it. This observation also suggests the high feasibility of a universal CH system. Finally, as for the DNA implementation of rotation operation, one can find some detailed discussion in =-=[2]-=-, while [17] discusses the DNA and restriction enzyme implementation of Turing machines. Acknowledgements This work was supported in part by Grant No. JSPS-RFTF 96I00101 from Research-for-the-Future P... |

8 | DNA splicing systems and Post Systems
- Ferretti, Yokomori
- 1996
(Show Context)
Citation Context ...work are, however, concerned with only the original (non-extended) model of splicing systems, while we are dealing with extended models of mixed splicing systems in this article. In a separate paper (=-=[5]-=-), we have discussed some new developments on the computational power of splicing systems in which, by establishing interesting relationships between splicing systems and Post systems, new characteriz... |