Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
Suffix trees
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Sebastien Ferre <Sebastien.Ferre@i...>
Subject: Re: [Caml-list] Suffix trees

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 .
I hope it will fit your needs. I thrived to make it

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:

Do not hesitate to ask me explanations about the interface
as the comments are rather limited :-).

Sébastien Ferré