Formal systems for gene assembly in ciliates.
From MaRDI portal
Publication:1853740
DOI10.1016/S0304-3975(01)00223-7zbMath1063.68054MaRDI QIDQ1853740
Ion Petre, Andrzej Ehrenfeucht, Grzegorz Rozenberg, David M. Prescott, Tero J.Harju
Publication date: 22 January 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
DNA computing; Ciliates; Gene assembly; Graph rewriting; String rewriting; Overlap graphs; Reduction systems
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68Q42: Grammars and rewriting systems
Related Items
LANGUAGE FAMILIES DEFINED BY A CILIATE BIO-OPERATION: HIERARCHIES AND DECISION PROBLEMS, 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, Parallelism in gene assembly, Sequential vs. Parallel complexity in simple gene assembly, Solutions to computational problems through gene assembly, Strategies of loop recombination in ciliates, Computing the graph-based parallel complexity of gene assembly, Computational virtuality in biological systems, Gene assembly through cyclic graph decomposition, Reducibility of gene patterns in ciliates using the breakpoint graph., Extending the Overlap Graph for Gene Assembly in Ciliates, Simple Operations for Gene Assembly
Cites Work
