Bryan O'Sullivan wrote:
ChrisK wrote:
That is almost certainly because the algorithm expects the source
string to have
a unique character at its end.
Chris is correct. I'll ensure that the docs make this clear.
Apologies, I should have thought of this myself.
Thanks.
Bryan O'Sullivan wrote:
I just posted a library named suffixtree to Hackage.
http://www.serpentine.com/software/suffixtree/
It implements Giegerich and Kurtz's lazy construction algorithm, with a
few tweaks for better performance and resource usage.
API docs:
Gleb Alexeyev wrote:
Bryan O'Sullivan wrote:
I just posted a library named suffixtree to Hackage.
http://www.serpentine.com/software/suffixtree/
It implements Giegerich and Kurtz's lazy construction algorithm, with
a few tweaks for better performance and resource usage.
API docs:
ChrisK wrote:
That is almost certainly because the algorithm expects the source string to have
a unique character at its end.
Chris is correct. I'll ensure that the docs make this clear.
b
___
Haskell-Cafe mailing list
