Skip to Main content Skip to Navigation
Conference papers

The Gapped-Factor Tree

Pierre Peterlongo 1 Julien Allali 1 Marie-France Sagot 2, 3, 4
2 HELIX - Computer science and genomics
Inria Grenoble - Rhône-Alpes, LBBE - Laboratoire de Biométrie et Biologie Evolutive - UMR 5558
4 Baobab
PEGASE - Département PEGASE [LBBE]
Abstract : We present a data structure to index a specific kind of factors, that is of substrings, called gapped-factors. A gapped-factor is a factor containing a gap that is ignored during the indexation. The data structure presented is based on the suffix tree and indexes all the gapped-factors of a text with a fixed size of gap, and only those. The construction of this data structure is done online in linear time and space. Such a data structure may play an important role in various pattern matching and motif inference problems, for instance in text filtration.
Document type :
Conference papers
Complete list of metadata

Cited literature [28 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00306572
Contributor : Julien Allali Connect in order to contact the contributor
Submitted on : Wednesday, January 14, 2009 - 4:50:32 PM
Last modification on : Monday, November 22, 2021 - 1:52:23 PM
Long-term archiving on: : Friday, November 25, 2016 - 11:36:47 PM

File

PSC2006_article18.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00306572, version 1

Citation

Pierre Peterlongo, Julien Allali, Marie-France Sagot. The Gapped-Factor Tree. Prague Stringology Conference 2006, 2006, Prague, Czech Republic. pp.182--196. ⟨hal-00306572⟩

Share

Metrics

Record views

441

Files downloads

159