Pré-Publication, Document De Travail Année : 2011

Uncommon Suffix Tries

Résumé

Common assumptions on the source producing the words inserted in a suffix trie with $n$ leaves lead to a $\log n$ height and saturation level. We provide an example of a suffix trie whose height increases faster than a power of $n$ and another one whose saturation level is negligible with respect to $\log n$. Both are built from VLMC (Variable Length Markov Chain) probabilistic sources; they are easily extended to families of sources having the same properties. The first example corresponds to a ''logarithmic infinite comb'' and enjoys a non uniform polynomial mixing. The second one corresponds to a ''factorial infinite comb'' for which mixing is uniform and exponential.

Fichier principal
Vignette du fichier
ccpp2.pdf (354.85 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-00652952 , version 1 (16-12-2011)
hal-00652952 , version 2 (20-12-2011)

Licence

Identifiants

Citer

Peggy Cénac, Brigitte Chauvin, Frédéric Paccaut, Nicolas Pouyanne. Uncommon Suffix Tries. 2011. ⟨hal-00652952v1⟩
284 Consultations
283 Téléchargements

Altmetric

Partager

  • More