Suffix tree clustering algorithm?

Question

I am studying in my final year of computer science and i need to get hold of a suffix tree clustering algorithm that can be used in javascript. I have searched all over the net but have come up with nothing and was wondering if anybody could help!

Answer 1

In the section, "Longest Repeated Substring", it says, "the longest repeated substring of txt[1..n] is indicated by the deepest fork node in the suffix tree, where depth is measured by the number of characters traversed from the root".
However, it doesn't seem to be always true(hmm...probably I interpret it incorrectly).
Consider the original string = abb$
(with index 1234)
the suffix tries looks like
bb$
root--------------
|
| abb$
|----------
the suffix tree looks like
(2,4)
root-------------
|
| (1,4)$
|---------
However, there isn't even a fork node.
But obviously, b is the longest repeated string.
Another example
Consider the original string = abc$
(with index 1234)
the suffix tries looks like
c$
root--------------
|
| bc$
|----------
|
|
| abc$
|----------
the suffix tree looks like
(3,4)
root--------------
|
| (2,4)
|----------
|
|
| (1,4)
|----------
However, there isn't even a fork node either. But in this case, there is no repated string.
Hope anyone can answer this. Thanks.