#### DMCA

## Simulating Boolean circuits by finite splicing (1999)

Venue: | In: Proceedings of the Congress on Evolutionary Computation |

Citations: | 6 - 0 self |

### Citations

224 |
Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- Head
- 1987
(Show Context)
Citation Context ... biochemical computing settings have been given by [OR96] and [AD97]. In this paper, we show how to simulate Boolean circuits by finite splicing systems, an abstract model of enzymatic recombination (=-=[Hea87]-=-, [Gat94], [P au96a]). We argue that using an abstract model of DNA computation as a basis leads to simulations of greater clarity and generality. In our construction, the running time of the simulati... |

60 | Simulating Boolean circuits on a DNA computer
- Ogihara, Ray
- 1997
(Show Context)
Citation Context ...l model to be simulated in a DNA computing context, Boolean circuits are especially interesting because of their parallelism. Simulations in concrete biochemical computing settings have been given by =-=[OR96]-=- and [AD97]. In this paper, we show how to simulate Boolean circuits by finite splicing systems, an abstract model of enzymatic recombination ([Hea87], [Gat94], [P au96a]). We argue that using an abst... |

55 |
On the splicing operation.
- Paun
- 1996
(Show Context)
Citation Context ...C Figure 2: The molecules cut in figure 1 combined crosswise between words. Head's definition was simplified by Gatterdam in [Gat94] and further generalized to encompass infinite rule sets by Paun in =-=[Pau9-=-6a]. In this paper, we use this latter definition: Definition 2.1 Let V be a finite alphabet not containing the symbols #; $. A splicing system over V is a construct S = (V; I ; R), where I V is th... |

42 |
Regular extended H systems are computationally universal.
- Paun
- 1996
(Show Context)
Citation Context ...ational power of splicing systems, two points are especially interesting: Splicing systems with a finite initial language and a regular rule set already generate all recursively enumerable languages (=-=[Pau96b]-=-), whereas splicing systems of finite components can only generate regular languages ([CH91], [Pix95], [HPP96]). Example 2.2 A biochemical recombination system containing the enzymes TaqI and SciNI de... |

32 | DNA simulation of Boolean circuits. In:
- Amos, Dunne, et al.
- 1998
(Show Context)
Citation Context ...be simulated in a DNA computing context, Boolean circuits are especially interesting because of their parallelism. Simulations in concrete biochemical computing settings have been given by [OR96] and =-=[AD97]-=-. In this paper, we show how to simulate Boolean circuits by finite splicing systems, an abstract model of enzymatic recombination ([Hea87], [Gat94], [P au96a]). We argue that using an abstract model ... |

27 |
Language theory and molecular genetics: Generative mechanisms suggested by DNA recombination.
- Head, Paun, et al.
- 1996
(Show Context)
Citation Context ...l language and a regular rule set already generate all recursively enumerable languages ([Pau96b]), whereas splicing systems of finite components can only generate regular languages ([CH91], [Pix95], =-=[HPP96]-=-). Example 2.2 A biochemical recombination system containing the enzymes TaqI and SciNI described above could be modelled using the alphabet f A T ; C G ; G C ; T A g and the splicing rules T A C G G ... |

17 | Splicing semigroups of dominoes and DNA,
- Harju
- 1991
(Show Context)
Citation Context ...h a finite initial language and a regular rule set already generate all recursively enumerable languages ([Pau96b]), whereas splicing systems of finite components can only generate regular languages (=-=[CH91]-=-, [Pix95], [HPP96]). Example 2.2 A biochemical recombination system containing the enzymes TaqI and SciNI described above could be modelled using the alphabet f A T ; C G ; G C ; T A g and the splicin... |

14 | Linear and circular splicing systems. - Pixton - 1995 |

12 |
and circular splicing systems
- Linear
- 1995
(Show Context)
Citation Context ...te initial language and a regular rule set already generate all recursively enumerable languages ([Pau96b]), whereas splicing systems of finite components can only generate regular languages ([CH91], =-=[Pix95]-=-, [HPP96]). Example 2.2 A biochemical recombination system containing the enzymes TaqI and SciNI described above could be modelled using the alphabet f A T ; C G ; G C ; T A g and the splicing rules T... |

2 |
DNA and twist free splicing systems.
- Gatterdam
- 1994
(Show Context)
Citation Context ...cal computing settings have been given by [OR96] and [AD97]. In this paper, we show how to simulate Boolean circuits by finite splicing systems, an abstract model of enzymatic recombination ([Hea87], =-=[Gat94]-=-, [P au96a]). We argue that using an abstract model of DNA computation as a basis leads to simulations of greater clarity and generality. In our construction, the running time of the simulating system... |

2 |
Spektrum Akademischer Verlag
- Biochemie
- 1991
(Show Context)
Citation Context ... the molecules cleft in figure 1, either the two pieces of the same molecule can reconnect, or the pieces can be combined crosswise, as the overhangs match. Figure 2 shows this second case. (See e.g. =-=[Str91]-=- for a detailed description. ) These two operations together, the sequence--specific cleaving of molecules and the ligating of matching pieces, are called recombination. This biochemical operation was... |