Generalized Suffix Tree Java Implementation

java suffix-tree
user119746 picture user119746 · Jun 9, 2009 · Viewed 19.6k times · Source

I am looking for a Java implementation of the Generalized Suffix Tree (GST) with the following features:

After the creation of the GST from say 1000 strings I would like find out how many of these 1000 strings contains some other string 's'.

The search must be quiet fast, as I need to apply the search on about 100'000 candidate strings of average length 10.

Answer

H Marcelo Morales picture H Marcelo Morales · Jun 9, 2009

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

Related questions

Short, Java implementation of a suffix tree and usage?

I'm looking for a short, simple suffix tree building/usage algorithm in Java. The best I've found so far lies withing the Semantic Discovery Toolkit, but the implementation is several thousand lines long and spans several classes. Ideally, the implementation …

Read More
How do I convert a String to an int in Java?

How can I convert a String to an int in Java? My String contains only numbers, and I want to return the number it represents. For example, given the string "1234" the result should be the number 1234.

Read More
How do I declare and initialize an array in Java?

How do I declare and initialize an array in Java?

Read More