Subject: [ANN] An efficient lazy suffix tree library
Newsgroups: gmane.comp.lang.haskell.cafe
Date: 2007-08-22 03:28:26 GMT (38 weeks, 1 day, 23 hours and 55 minutes ago)
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. <b