Gene assembly through cyclic graph decomposition

DOI10.1016/S0304-3975(02)00019-1zbMath1024.68039MaRDI QIDQ1605478

Tero J.Harju, Grzegorz Rozenberg, Andrzej Ehrenfeucht

Publication date: 18 July 2002

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

Mathematics Subject Classification ID

Related Items (9)

Recurring patterns among scrambled genes in the encrypted genome of the ciliate \textit{Oxytricha trifallax} ⋮ Sorting by reversals and the theory of 4-regular graphs ⋮ Recombination faults in gene assembly in ciliates modeled using multimatroids ⋮ Double occurrence words: their graphs and matrices ⋮ RNA-guided DNA assembly ⋮ Four-regular graphs with rigid vertices associated to DNA recombination ⋮ DNA recombination through assembly graphs ⋮ GETGRATS ⋮ Rewriting rule chains modeling DNA rearrangement pathways

Cites Work

• Formal systems for gene assembly in ciliates.
• DNA physical mapping and alternating Eulerian cycles in colored graphs
• String and graph reduction systems for gene assembly in ciliates
• A New Applicable Proof of the Euler Circuit Theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Gene assembly through cyclic graph decomposition