Uncommon suffix tries
Peggy Cénac, Brigitte Chauvin, Frédéric Paccaut, Nicolas Pouyanne · Random Structures and Algorithms · 2013
Abstract Common assumptions on the source producing the words inserted in a suffix trie with n leaves lead to a 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 . Both are built from VLMC (Variable Length Markov Chain) probabilistic sources and are easily extended to families of tries 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. © 2013 Wiley Periodicals, Inc. Random Struct. Alg., 46, 117–141, 2015