Extending the Overlap Graph for Gene Assembly in Ciliates

From MaRDI portal
Publication:3540104

DOI10.1007/978-3-540-88282-4_14zbMATH Open1156.68420arXiv0712.3380OpenAlexW1534477878MaRDI QIDQ3540104FDOQ3540104


Authors: Robert Brijder, Hendrik Jan Hoogeboom Edit this on Wikidata


Publication date: 20 November 2008

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Abstract: Gene assembly is an intricate biological process that has been studied formally and modeled through string and graph rewriting systems. Recently, a restriction of the general (intramolecular) model, called simple gene assembly, has been introduced. This restriction has subsequently been defined as a string rewriting system. We show that by extending the notion of overlap graph it is possible to define a graph rewriting system for two of the three types of rules that make up simple gene assembly. It turns out that this graph rewriting system is less involved than its corresponding string rewriting system. Finally, we give characterizations of the `power' of both types of graph rewriting rules. Because of the equivalence of these string and graph rewriting systems, the given characterizations can be carried over to the string rewriting system.


Full work available at URL: https://arxiv.org/abs/0712.3380




Recommendations



Cites Work


Cited In (7)





This page was built for publication: Extending the Overlap Graph for Gene Assembly in Ciliates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540104)