Directed Overlap-Inclusion Graphs as Representations of Ciliate Genes

A1 Originalartikel i en vetenskaplig tidskrift (referentgranskad)


Interna författare/redaktörer


Publikationens författare: Sepinoud Azimi, Tero Harju, Miika Langille, Ion Petre, Vladimir Rogojin
Förläggare: IOS Press
Publiceringsår: 2011
Tidskrift: Fundamenta Informaticae
Volym: 110
Nummer: 1-4
Artikelns första sida, sidnummer: 29
Artikelns sista sida, sidnummer: 44
eISSN: 1875-8681


Abstrakt

The simple intramolecular model for gene assembly in ciliates consists of three molecular operations based on local DNA manipulations. It was shown to predict correctly the assembly of all currently known ciliate gene patterns. 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. A different formalization in terms of overlap-inclusion graphs, recently introduced
by Brijder and Hoogeboom, proved well-suited to describe two of the three operations of the model and their combinatorial properties. We introduce in this paper an extension of the framework of Brijder and Hoogeboom in terms of directed overlap-inclusion graphs where more of the linear
structure of the ciliate genes is described. We investigate a number of combinatorial properties of
these graphs, including a necessary property in terms of forbidden induced subgraphs.

Senast uppdaterad 2019-17-11 vid 03:49