[Caml-list] Suffix trees
Jon Harrop
Anyone got any high-performance suffix tree implementations in OCaml? (I've
seen Jean-Christophe's)
--
Dr Jon D Harrop, Flying Frog Consultancy Ltd.
OCaml for Scientists
http://www.ffconsultancy.com/products/ocaml_for_scientists/?e
_______________________________________________
Caml-list mailing list. Subscription management:
http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list
Archives: http://caml.inria.fr
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
Sebastien Ferre
Jon Harrop wrote:
> Anyone got any high-performance suffix tree implementations in OCaml? (I've
> seen Jean-Christophe's)
you can find the implementation I made for my
own needs at http://www.irisa.fr/LIS/ferre/software.en.html .
I hope it will fit your needs. I thrived to make it
efficient.
It is possible to make it more efficient by
removing the code for the computation of maximal substrings
that makes the computation of the suffix tree in O(n.ln(n))
instead of O(n).
The motivation for the computation of these maximal substrings
can be found in the following paper:
http://www.springerlink.com/content/a2p06g831821054g/
Do not hesitate to ask me explanations about the interface
as the comments are rather limited :-).
Cheers,
Sébastien Ferré