Application of suffix trees for the acquisition of common motifs with gaps in a set of strings - CNRS - Centre national de la recherche scientifique Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

Application of suffix trees for the acquisition of common motifs with gaps in a set of strings

Résumé

The inference of common motifs in a set of strings is a well-known problem with many applications in biological sciences. We study a new variant of this problem that oers a solution with the added exibility in the length of the common motifs to be found. We present algorithms that allow stretching of the length of the motifs as well as elasticity in the length of gaps between the motifs. The main data structure used in these algorithms is the suffix tree.
Fichier principal
Vignette du fichier
gapmotifs.pdf (137.18 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00328081 , version 1 (09-10-2008)

Identifiants

  • HAL Id : inria-00328081 , version 1

Citer

Pavlos Antoniou, Maxime Crochemore, Costas Iliopoulos, Pierre Peterlongo. Application of suffix trees for the acquisition of common motifs with gaps in a set of strings. International Conference on Language and Automata Theory and Applications, Mar 2007, Tarragona, Spain. ⟨inria-00328081⟩
142 Consultations
163 Téléchargements

Partager

Gmail Facebook X LinkedIn More