Probabilistic Suffix Trees: Project Home – R-Forge

Project description

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.

Public Areas
 Mailing Lists (1 public mailing list)
 SCM Repository (Subversion: 689 commits, 113 adds)
Project Members
Thanks to:
Vienna University of Economics and Business University of Wisconsin - Madison Powered By FusionForge