Formal systems for gene assembly in ciliates.

DOI10.1016/S0304-3975(01)00223-7zbMath1063.68054OpenAlexW1979909102MaRDI QIDQ1853740

Tero J.Harju, David M. Prescott, Ion Petre, Andrzej Ehrenfeucht, Grzegorz Rozenberg

Publication date: 22 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00223-7

zbMATH Keywords

DNA computingCiliatesGene assemblyGraph rewritingString rewritingOverlap graphsReduction systems

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Grammars and rewriting systems (68Q42)

Related Items (16)

Combining overlap and containment for gene assembly in ciliates ⋮ Parallelism in gene assembly ⋮ 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 ⋮ Sequential vs. Parallel complexity in simple gene assembly ⋮ Extending the Overlap Graph for Gene Assembly in Ciliates ⋮ Solutions to computational problems through gene assembly ⋮ Strategies of loop recombination in ciliates ⋮ Computing the graph-based parallel complexity of gene assembly ⋮ Reducibility of gene patterns in ciliates using the breakpoint graph. ⋮ Pivots, determinants, and perfect matchings of graphs ⋮ Computational virtuality in biological systems ⋮ Simple Operations for Gene Assembly ⋮ LANGUAGE FAMILIES DEFINED BY A CILIATE BIO-OPERATION: HIERARCHIES AND DECISION PROBLEMS ⋮ Gene assembly through cyclic graph decomposition

Cites Work

• Graphic presentations of isotropic systems
• Circle graph obstructions
• A proof of a circle graph characterization
• String and graph reduction systems for gene assembly in ciliates
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Formal systems for gene assembly in ciliates.