String and graph reduction systems for gene assembly in ciliates
From MaRDI portal
Publication:3146247
DOI10.1017/S0960129501003516zbMath1007.68127MaRDI QIDQ3146247
Ion Petre, Andrzej Ehrenfeucht, Grzegorz Rozenberg, David M. Prescott
Publication date: 11 September 2002
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
68Q80: Cellular automata (computational aspects)
Related Items
Graph reductions, binary rank, and pivots in gene assembly, Maximal pivots on graphs with an application to gene assembly, Pivots, determinants, and perfect matchings of graphs, Combining overlap and containment for gene assembly in ciliates, Solutions to computational problems through gene assembly, Strategies of loop recombination in ciliates, Gene assembly through cyclic graph decomposition, Formal systems for gene assembly in ciliates., Nullity invariance for pivot and the interlace polynomial, Extending the Overlap Graph for Gene Assembly in Ciliates, Simple Operations for Gene Assembly