[Haskell-cafe] Suffix tree
jon at ffconsultancy.com
Sun Aug 12 18:09:12 EDT 2007
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
More information about the Haskell-Cafe