pmcharrison/suffixTree: Timestamped Suffix Trees (TSTs)

Timestamped suffix trees (TSTs) are suffix trees that store timestamps for each state transition in the training sequence(s). Given a sequence of consecutive symbols, the TST can efficiently return the timepoints when this sequence occurred in the training data, the symbols that followed this sequence in the training data, and the timepoints when these continuation symbols were observed.

Getting started

Package details

LicenseMIT + file LICENSE
Package repositoryView on GitHub
Installation Install the latest version of this package by entering the following in R:
pmcharrison/suffixTree documentation built on May 3, 2019, 11:52 p.m.