The at-most $k$-deep factor tree - Archive ouverte HAL Access content directly
Reports Year : 2004

The at-most $k$-deep factor tree

Julien Allali
Marie-France Sagot


We present a new data structure to index strings that is very similar to a suffix tree. The new structure indexes the factors of a string whose length does not exceed k, and only those. We call such structure the at most k-deep factor tree, or k-factor tree for short. Time and space complexities for constructing the tree are linear in the length of the string. The construction is on-line. Compared to a suffix tree, the k-factor tree offers a substantial gain in terms of space complexity for small values of k, as well as a gain in time when used for enumerating all occurrences of a pattern in a text indexed by such a k-factor tree.
Fichier principal
Vignette du fichier
HAL.pdf (318.58 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-00627813 , version 1 (29-09-2011)


  • HAL Id : hal-00627813 , version 1


Julien Allali, Marie-France Sagot. The at-most $k$-deep factor tree. 2004. ⟨hal-00627813⟩
186 View
178 Download


Gmail Mastodon Facebook X LinkedIn More