Does anybody know of a suffix tree implementation for Haskell? Are there algorithms for a (lazy) functional setting?
My reference is Dan Gusfield: "Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology". Thanks, Markus -- Markus Schnell Infineon Technologies AG, CPR ET Tel +49 (89) 234-20875 _______________________________________________ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell
