[Haskell-cafe] Suffix tree

[Jon Harrop]

Suffix trees are a data structure used to search for a substring of length "m" 
in a string of length "n" in O(m) time. Suffix trees can also be used for 
efficient approximate searches. This data structure is of particular 
importance in bioinformatics.

Does anyone have any Haskell code implementing suffix trees? I'm particularly 
interested in high-performance construction.

-- 
Dr Jon D Harrop, Flying Frog Consultancy Ltd.
OCaml for Scientists
http://www.ffconsultancy.com/products/ocaml_for_scientists/?e