Generalizing Sebastién Ferre's Generalized Suffix Trees over any alphabets
OCaml
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Failed to load latest commit information.
README
TODO
cis.ml
cis.mli
intest.ml
intseq.ml
lSet.ml
suffix.ml
suffix.mli
suffix_tree.ml

README

I've got wonderful suffix tree by Sébastien Ferre <ferre@irisa.fr>, and quickly realized that
they're GSTs, but only over regular character strings. I am using them with sensor data where
observations are generally integer sequences. Thus I went ahead and generalized the module,
renaming is suffix.ml, and the functor is now Tree.

An example of an alphabet is intseq.ml, where Intseq is defined as an integer alphabet and its
strings are int arrays.

An example of testing from the toplevel is intest.ml.

Let me know if you want to improve this on Github!

Cheers,
Alexy Khrabrov <deliverable@gmail.com>

The list of files:
-- original Sébastien's:
cis.ml/i
lSet.ml
suffix_tree.ml
-- with Alexy's additions:
suffix.ml
intseq.ml
intest.ml