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

Abstract : 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.
Type de document :
Communication dans un congrès
International Conference on Language and Automata Theory and Applications, Mar 2007, Tarragona, Spain. 2007
Liste complète des métadonnées

Littérature citée [14 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00328081
Contributeur : Pierre Peterlongo <>
Soumis le : jeudi 9 octobre 2008 - 16:20:33
Dernière modification le : jeudi 19 avril 2018 - 14:24:03
Document(s) archivé(s) le : mardi 9 octobre 2012 - 10:35:32

Fichier

gapmotifs.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00328081, version 1

Citation

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. 2007. 〈inria-00328081〉

Partager

Métriques

Consultations de la notice

258

Téléchargements de fichiers

161