String and graph reduction systems for gene assembly in ciliates

DOI10.1017/S0960129501003516zbMath1007.68127OpenAlexW1974684756MaRDI QIDQ3146247

David M. Prescott, Ion Petre, Andrzej Ehrenfeucht, Grzegorz Rozenberg

Publication date: 11 September 2002

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129501003516

zbMATH Keywords

graph reduction systems

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items

Combining overlap and containment for gene assembly in ciliates, Maximal pivots on graphs with an application to gene assembly, Recombination faults in gene assembly in ciliates modeled using multimatroids, Graph reductions, binary rank, and pivots in gene assembly, Nullity invariance for pivot and the interlace polynomial, Extending the Overlap Graph for Gene Assembly in Ciliates, Solutions to computational problems through gene assembly, Strategies of loop recombination in ciliates, Pivots, determinants, and perfect matchings of graphs, Simple Operations for Gene Assembly, Formal systems for gene assembly in ciliates., Gene assembly through cyclic graph decomposition