Questions tagged [pst]
Probabilistic Suffix Trees is a data structure for storing variable-length Markov chains.
1
question
2
votes
1
answer
63
views
Testing pdist() for statistical significance
Using pdist() in the PST package, two probabilistic suffix trees (PSTs) can be compared to each other. The function will output ...