Indexing gapped-factors using a tree - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles International Journal of Foundations of Computer Science Year : 2008

Indexing gapped-factors using a tree


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.
Fichier principal
Vignette du fichier
biFactorTree_IJFCS_erratum.pdf (175.29 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00179719 , version 1 (24-10-2007)



Pierre Peterlongo, Julien Allali, Marie-France Sagot. Indexing gapped-factors using a tree. International Journal of Foundations of Computer Science, 2008, 19 (1), pp.71-87. ⟨10.1142/S0129054108005541⟩. ⟨inria-00179719⟩
307 View
134 Download



Gmail Facebook X LinkedIn More