Working through some of Dan Gusfield's Algorithms on Strings, Trees and Sequences with the primary goal of implementing a performant, generalized suffix tree.

There are many useful applications of suffix trees. I was first motivated by the problem of finding the longest common substring of a set of strings, as presented on Rosalind

Suffix Tree goals:

• longest common substring of a set of strings
• linear time construction with Ukkonen's algorithm
• linear time construction with Weiner's algorithm
• convert to suffix array