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/publications.html
The second paper down in particular ("A Comparison of Imperative and
Purely Functional Suffix Tree Constructions") develops an efficient
implementation in Haskell. There are some more recent papers also
there which may be of use to you as well.
Cheers,
Andrew Bromage
_______________________________________________
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
