Simple gene assembly as a rewriting of directed overlap-inclusion graphs

Journal Article (2012)
Author(s)

Sepinoud Azimi (Åbo Akademi University)

Tero Harju (Turku Centre for Computer Science, University of Turku)

Miika Langille (Åbo Akademi University)

Ion Petre (Turku Centre for Computer Science, Åbo Akademi University)

Affiliation
External organisation
DOI related publication
https://doi.org/10.1016/j.tcs.2012.04.018
More Info
expand_more
Publication Year
2012
Language
English
Affiliation
External organisation
Volume number
454
Pages (from-to)
30-37

Abstract

The simple intramolecular model for gene assembly in ciliates consists of three molecular operations, simple ld, simple hi and simple dlad. Mathematical models in terms of signed permutations and signed strings proved limited in capturing some of the combinatorial details of the simple gene assembly process. Brijder and Hoogeboom introduced a new model in terms of overlap-inclusion graphs which could describe two of the three operations of the model and their combinatorial properties. To capture the third operation, we extended their framework to directed overlap-inclusion (DOI) graphs in Azimi et al. (2011) [1]. In this paper we introduce DOI graph-based rewriting rules that capture all three operations of the simple gene assembly model and prove that they are equivalent to the string-based formalization of the model.

No files available

Metadata only record. There are no files for this record.