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

Sepinoud Azimi, Tero Harju, Miika Langille, Ion Petre*

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

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.
Original languageEnglish
Pages (from-to)30-37
Number of pages8
JournalTheoretical Computer Science
Volume454
DOIs
Publication statusPublished - 2012
Externally publishedYes

Keywords

  • Directed overlap inclusion graphs
  • Graph-based simple operations
  • Simple gene assembly

Fingerprint

Dive into the research topics of 'Simple gene assembly as a rewriting of directed overlap-inclusion graphs'. Together they form a unique fingerprint.

Cite this