Formal systems for gene assembly in ciliates

DNA processing in ciliates, a very ancient group of organisms, is among the most sophisticated DNA processing in living organisms. It has a quite clear computational structure and even uses explicitly the linked list data structure! Particularly interesting from the computational point of view is the process of gene assembly from its micronuclear to its macronuclear form. We investigate here the string rewriting and the graph rewriting models of this process, involving three molecular operations, which together form a universal set of operations in the sense that they can assembly any macronuclear gene from its micronuclear form. In particular we prove that although the graph rewriting system is more "abstract" than the string rewriting system, no "essential information" is lost, in the sense that one can translate assembly strategies from one system into the other.

[1]  Ion Petre,et al.  Universal and simple operations for gene assembly in ciliates , 2001, Where Mathematics, Computer Science, Linguistics and Biology Meet.

[2]  David I. Lewin,et al.  DNA computing , 2002, Comput. Sci. Eng..

[3]  Andrzej Ehrenfeucht,et al.  Molecular operations for DNA processing in hypotrichous ciliates , 2001 .

[4]  Ion Petre,et al.  String and Graph Reduction Systems for Gene Assembly in Ciliates , 2002, Math. Struct. Comput. Sci..

[5]  Warren D. Smith DNA computers in vitro and vivo , 1995, DNA Based Computers.

[6]  Lila Kari,et al.  Universal Molecular Computation in Ciliates , 2002 .

[7]  André Bouchet,et al.  Graphic presentations of isotropic systems , 1987, J. Comb. Theory, Ser. B.

[8]  Erik Winfree,et al.  Evolution as Computation , 2002, Natural Computing Series.

[9]  Andrzej Ehrenfeucht,et al.  Computational Aspects of Gene (Un)Scrambling in Ciliates , 2002 .

[10]  R. Möhring Algorithmic graph theory and perfect graphs , 1986 .

[11]  L F Landweber,et al.  The evolution of cellular computing: nature's solution to a computational problem. , 1999, Bio Systems.

[12]  André Bouchet,et al.  Circle Graph Obstructions , 1994, J. Comb. Theory, Ser. B.

[13]  Emmanuel Gasse A proof of a circle graph characterization , 1997, Discret. Math..