What is considered the best Java Suffix Tree implementation?

java data-structures tree suffix-tree suffix-array
Koen Peters picture Koen Peters · May 10, 2013 · Viewed 7.3k times · Source

I need a suffix tree Java Implementation. After some googling I concluded that the libdivsufsort C implementation is the best one around. Is there a Java implementation of the same (or almost as good) quality and that is preferably open source. The implementation should be production code, not proof of concept code.

Answer

Naren picture Naren · Jul 30, 2013

Try following some of the example in Java: http://users.cis.fiu.edu/~weiss/dsaajava3/code/SuffixArray.java http://algs4.cs.princeton.edu/63suffix/SuffixArray.java.html

http://algs4.cs.princeton.edu/63suffix/

Related questions

How to implement a tree data-structure in Java?

Is there any standard Java library class to represent a tree in Java? Specifically I need to represent the following: The sub-tree at any node can have an arbitrary number of children Each node (after the root) and it's children …

Read More
Binary Search Tree - Java Implementation

I'm writing a program that utilizes a binary search tree to store data. In a previous program (unrelated), I was able to implement a linked list using an implementation provided with Java SE6. Is there something similar for a binary …

Read More
Reverse A Binary Tree (Left to Right)

I was looking at interview questions and I recently came upon one that asked you how to reverse a general binary tree, like flip it from right to left. So for example if we had the binary tree 6 / \ 3 4 / \ / \ 7 3 8 1 Reversing it …

Read More