* Suffix trees
@ 2007-08-13 9:17 Jon Harrop
2007-08-31 8:25 ` [Caml-list] " Sebastien Ferre
0 siblings, 1 reply; 2+ messages in thread
From: Jon Harrop @ 2007-08-13 9:17 UTC (permalink / raw)
To: caml-list
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
^ permalink raw reply [flat|nested] 2+ messages in thread
* Re: [Caml-list] Suffix trees
2007-08-13 9:17 Suffix trees Jon Harrop
@ 2007-08-31 8:25 ` Sebastien Ferre
0 siblings, 0 replies; 2+ messages in thread
From: Sebastien Ferre @ 2007-08-31 8:25 UTC (permalink / raw)
To: Jon Harrop, caml-list
Hi,
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é
^ permalink raw reply [flat|nested] 2+ messages in thread
end of thread, other threads:[~2007-08-31 8:25 UTC | newest]
Thread overview: 2+ messages (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2007-08-13 9:17 Suffix trees Jon Harrop
2007-08-31 8:25 ` [Caml-list] " Sebastien Ferre
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).