G'day.
On Tue, Jul 01, 2003 at 10:02:36AM +0200, [EMAIL PROTECTED] wrote:
> Does anybody know of a suffix tree implementation
> for Haskell? Are there algorithms for a (lazy) functional
> setting?
Yes. Take a look here:
http://www.techfak.uni-bielefeld.de/~kurtz/pub
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 Te
