Variable length Markov chains: linguistic and genomic applications and research issues
Antonio Galves (IME-USP)
This class of models was first introduced in the information theory literature by
Rissanen (1983) under the name of finite memory source or probabilistic suffix tree.
Rissanen’s goal was to obtain a universal model for data compression. More recently
these models became quite popular in the statistics literature under the name of Variable
Length Markov Chains (VLMC).