Generalized Suffix Tree Java Implementation

 

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.

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

非常规后缀树的Java实现可在以下位置获得：http://illya-keeplearning.blogspot.com/2009/04/suffix-trees-java-ukkonens-algorithm.html

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 .
    • 链接地址: http://www.djcxy.com/p/40086.html

    上一篇: 如何从字符串数组中按任何顺序匹配和突出显示所有术语？

    下一篇: 通用后缀树Java实现