R-Forge Logo

Welcome to Probabilistic Suffix Trees project!

The PST library allows to fit and visualize Probabilistic Suffix Trees (PST), the construction that stores Variable Length Markov Chains (VLMC). Fitted PSTs can be used to predict, generate or impute categorical sequences.

No content added.

The project summary page you can find here.