• TUCS Publication Series
• How to Publish in TUCS Series
• Publication Search
• Publication Graph
• Publication Input
• Publication Input Guide
• JuFo Browser

Simple Gene Assembly as a Rewriting of Directed Overlap-Inclusion Graphs

Sepinoud Azimi, Tero Harju, Miika Langille, Ion Petre, Simple Gene Assembly as a Rewriting of Directed Overlap-Inclusion Graphs. Theoretical Computer Science 454, 30–37, 2012.

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). 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.

BibTeX entry:

@ARTICLE{jAzHaLaPe12a,
  title = {Simple Gene Assembly as a Rewriting of Directed Overlap-Inclusion Graphs},
  author = {Azimi, Sepinoud and Harju, Tero and Langille, Miika and Petre, Ion},
  journal = {Theoretical Computer Science},
  volume = {454},
  publisher = {Elsevier},
  pages = {30–37},
  year = {2012},
  keywords = {Simple gene assembly, Directed overlap inclusion graphs, Graph-based simple operations},
}

Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics, Computational Biomodeling Laboratory (Combio Lab)

Publication Forum rating of this publication: level 2

Edit publication