Generalized Suffix Tree Java Implementation [closed]

Answer 1

Here is my implementation of SuffixTree: https://github.com/losvald/sglj/blob/master/src/main/java/org/sglj/util/PATTrie.java

Among other things, it supports storing arbitrary data in nodes, and finding the set of values associated with the prefix.

Answer 2

Try The Semantic Discovery Toolkit. It has an implementation on text/src/java/org/sd/text/radixtree

Answer 3

You can find an implementation of a Generalized Suffix Tree in Java here. I tried to document it as much as I could, so you might find it useful.

Answer 4

There is a Java implementation of a Non-General Suffix Tree is available at: http://illya-keeplearning.blogspot.com/2009/04/suffix-trees-java-ukkonens-algorithm.html

Answer 5

I created a suffix tree in Java that allows you easily add your own search functionality and other matching algorithms. My blog post, Suffix Trees in Java, has an overview as well as instructions for downloaded the latest version. My Java implementation is based on Mark Nelson's Fast String Searching With Suffix Trees article.

Update 2016-06-18

• The library containing the suffix tree implementation described above is now available at https://bitbucket.org/globalmentor/globalmentor-core .
• The latest version of the library is available from Maven Central at http://search.maven.org/#search%7Cga%7C1%7Cg%3A%22com.globalmentor%22%20AND%20a%3A%22globalmentor-core%22 .