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.
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/inria-00328081
Contributor : Pierre Peterlongo <>
Submitted on : Thursday, October 9, 2008 - 4:20:33 PM
Last modification on : Thursday, February 7, 2019 - 2:43:26 PM
Long-term archiving on: Tuesday, October 9, 2012 - 10:35:32 AM

File

gapmotifs.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00328081, version 1

Collections

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. ⟨inria-00328081⟩

Share

Metrics

Record views

351

Files downloads

194