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

by Takashi Yokomori , Satoshi Kobayashi , Claudio Ferretti
Venue:Proc. of IEEE Intern. Conf. on Evol. Comput. (ICEC'97
Citations:22 - 5 self

Documents Related by Co-Citation

616 Molecular Computation Of Solutions To Combinatorial Problems – Leonard M. Adleman - 1994
189 Formal language theory and dna: an analysis of the generative capacity of specific recombinant behaviors – T Head - 1987
56 On the splicing operation – G Păun - 1996
80 A DNA and restriction enzyme implementation of Turing Machines. – Paul Wilhelm Karl Rothemund
21 DNA Computing Based on Splicing: Universality Results – Erzsébet Csuhaj-Varjú, Rudolf Freund, Lila Kari, Gheorghe Păun - 1996
487 Formal Languages – Ning Yu - 1973
18 Circular DNA and splicing systems – Rani Siromoney, K G Subramanian, V Rajkumar Dare - 1992
23 Splicing schemes and DNA – T Head - 1992
42 Parallel Molecular Computation: Models and Simulations – J H Reif - 1999
60 Speeding Up Computations via Molecular Biology – Richard J. Lipton - 1994
13 Linear and Circular Splicing Systems – Dennis Pixton - 1995
21 On the undecidability of splicing systems – K L Denninghoff, R W Gatterdam - 1989
20 Splicing systems and regularity – R W Gatterdam - 1989
29 Computing with DNA – Donald Beaver - 1995
64 Building An Associative Memory Vastly Larger Than The Brain. Science 268 – E Baum - 1995
108 DNA solution of hard computational problems – R J Lipton - 1995
15 Splicing schemes and DNA. Lindenmayer Systems; Impact on Theoretical computer science and developmental biology – Thomas Head - 1992
10 extended H systems are computationally universal – Regular
18 Contextual Insertions/deletions and Computability – Lila Kari, Gabriel Thierrin - 1996