[Haskell-cafe] Re: [ANN] An efficient lazy suffix tree library

Gleb Alexeyev gleb.alexeev at gmail.com
Mon Aug 27 12:04:52 EDT 2007

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:
> http://darcs.serpentine.com/suffixtree/dist/doc/html/Data-SuffixTree.html
> I've tested it on multi-megabyte input strings.
I think I found a bug:
import qualified Data.SuffixTree as T

 > T.countRepeats "ab" (T.construct "abab")

More information about the Haskell-Cafe mailing list