The Gapped-Factor Tree - Archive ouverte HAL Access content directly
Conference Papers Year : 2006

The Gapped-Factor Tree

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
PSC2006_article18.pdf (193.92 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00306572 , version 1 (14-01-2009)

Identifiers

  • HAL Id : hal-00306572 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More