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

Bryan O'Sullivan bos at serpentine.com
Tue Aug 21 23:28:26 EDT 2007

I just posted a library named suffixtree to Hackage.


It implements Giegerich and Kurtz's lazy construction algorithm, with a 
few tweaks for better performance and resource usage.

API docs:


I've tested it on multi-megabyte input strings.


More information about the Haskell-Cafe mailing list