Searching for Smallest Grammars on Large Sequences and Application to DNA - Inria - Institut national de recherche en sciences et technologies du numérique
Journal Articles Journal of Discrete Algorithms Year : 2012

Searching for Smallest Grammars on Large Sequences and Application to DNA

Abstract

Motivated by the inference of the structure of genomic sequences, we address here the smallest grammar problem. In previous work, we introduced a new perspective on this problem, splitting the task into two different optimization problems: choosing which words will be considered constituents of the final grammar and finding a minimal parsing with these constituents. Here we focus on making these ideas applicable on large sequences. First, we improve the complexity of existing algorithms by using the concept of maximal repeats when choosing which substrings will be the constituents of the grammar. Then, we improve the size of the grammars by cautiously adding a minimal parsing optimization step. Together, these approaches enable us to propose new practical algorithms that return smaller grammars (up to 10\%) in approximately the same amount of time than their competitors on a classical set of genomic sequences and on whole genomes of model organisms.
Fichier principal
Vignette du fichier
preprint_jda.pdf (324.46 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

inria-00536633 , version 1 (09-10-2012)

Identifiers

Cite

Rafael Carrascosa, François Coste, Matthias Gallé, Gabriel Infante-Lopez. Searching for Smallest Grammars on Large Sequences and Application to DNA. Journal of Discrete Algorithms, 2012, Special issue on Stringology, Bioinformatics and Algorithms, 11, pp.62-72. ⟨10.1016/j.jda.2011.04.006⟩. ⟨inria-00536633⟩
540 View
233 Download

Altmetric

Share

More