简短，Java实现后缀树和用法？ [英] Short, Java implementation of a suffix tree and usage?

问题描述

我正在寻找一种简短的，简单的Java后缀树构建/使用算法。到目前为止，我发现的最好的是使用语义发现工具包，但实现是几千行，并跨越几个类。理想情况下，实现将尽可能短，跨度不超过几百行。

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 would be as short as possible and span no more than a few hundred lines.

有没有人有这样的实现？

Does anyone have such an implementation?

推荐答案

我刚刚完成了后缀树的Java实现。在我的博客文章中，您可以找到有关后缀树的更多信息，请参阅如何使用我的库，以及使用Subversion和Maven下载和构建库。是的，它比单个类文件中的几行更长，但它是高度记录的，并且是为了实际目的而在现实世界中创建的。此外，它使用Ukkonen方法进行线性时间构造。 （这里提到的大多数实现至少有O（n ^ 2）运行时间。）

I just finished a Java implementation of a suffix tree. In my blog entry you can find out more about suffix trees, see how to use my library, as well as download and build the library using Subversion and Maven. Yes, it's longer than just a few lines in a single class file, but it is highly documented and is created for use in the real world for practical purposes. In addition, it uses the Ukkonen approach for linear time construction. (Most of the implementations noted here have at least O(n^2) running time.)

这篇关于简短，Java实现后缀树和用法？的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！