Fig. 2

Illustration of the data structures in the variable-length Markov chain for the sequence CACAC. The ’-’ character is used to denote the end of the sequence. Above each node in table, we illustrate the node label. The Right-most and Leaf vectors are in practice stored in a single vector with byte-flags, which also marks nodes as unevaluated. The reverse suffix links defines the edges of the probabilistic suffix tree. We do not include implicit nodes here to make the example less verbose