Suffix trees

Hi all, Does anybody know of any high-performance http://en.wikipedia.org/wiki/Suffix_tree suffix tree implementation in OCaml? Naive implementations are also

Message 1 of 5
, Apr 16, 2009

0 Attachment

Hi all,

Does anybody know of any high-performance http://en.wikipedia.org/wiki/Suffix_tree suffix tree implementation in
OCaml?
Naive implementations are also welcome. I need a fast algorithm to compare
strings allowing errors, so any other implementation of approximate string
matching is also welcome.

Yes, I have already checked that before. This implementation relies on
several other modules from the author and is a bit complicated to follow it.
That is why I have asked for alternative implementations.

... Jean-Christophe Filliatre has a generic implementation that can be instantiated with different kinds of dictionary, IIRC. I played with it a few years ago

Message 5 of 5
, Apr 20, 2009

0 Attachment

On Thursday 16 April 2009 17:27:13 citromatik wrote:

> Hi all,
>
> Does anybody know of any high-performance
> http://en.wikipedia.org/wiki/Suffix_tree suffix tree implementation in
> OCaml?
> Naive implementations are also welcome. I need a fast algorithm to compare
> strings allowing errors, so any other implementation of approximate string
> matching is also welcome.

Jean-Christophe Filliatre has a generic implementation that can be
instantiated with different kinds of dictionary, IIRC. I played with it a few
years ago and it works but it over 10x slower than implementations in other
languages.