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.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...