Comments on: Announcing Data.SuffixTree, a lazy, efficient Haskell suffix tree http://www.serpentine.com/blog/2007/08/23/announcing-datasuffixtree-a-lazy-efficient-haskell-suffix-tree/ Bryan O'Sullivan's blog Wed, 08 Feb 2012 06:41:38 +0000 hourly 1 http://wordpress.org/?v=3.3.1 By: Bryan O'Sullivan http://www.serpentine.com/blog/2007/08/23/announcing-datasuffixtree-a-lazy-efficient-haskell-suffix-tree/comment-page-1/#comment-74429 Bryan O'Sullivan Fri, 24 Aug 2007 19:50:32 +0000 http://www.serpentine.com/blog/2007/08/23/announcing-datasuffixtree-a-lazy-efficient-haskell-suffix-tree/#comment-74429 No, the library isn't only useful for searching. It's also usable for a number of other tasks, such as counting repeats, maximal unique matching, and so on. If you wanted to be able to store arbitrary sequences, you'd need a trie, not a suffix tree. The two are related, but they're not the same, and you can't use the suffix tree construction algorithm to create a trie. No, the library isn’t only useful for searching. It’s also usable for a number of other tasks, such as counting repeats, maximal unique matching, and so on.

If you wanted to be able to store arbitrary sequences, you’d need a trie, not a suffix tree. The two are related, but they’re not the same, and you can’t use the suffix tree construction algorithm to create a trie.

]]> By: Dylan Thurston http://www.serpentine.com/blog/2007/08/23/announcing-datasuffixtree-a-lazy-efficient-haskell-suffix-tree/comment-page-1/#comment-74293 Dylan Thurston Fri, 24 Aug 2007 08:18:23 +0000 http://www.serpentine.com/blog/2007/08/23/announcing-datasuffixtree-a-lazy-efficient-haskell-suffix-tree/#comment-74293 I'm surprised that construction is so limited; right now the library is only useful for searching for a sequence in a long list and not, for instance, for looking up identifiers. That is, I think construct should have type construct' :: (Ord a) => [[a]] -> STree a where the constructor you have now is construct l = construct' (tails l) I’m surprised that construction is so limited; right now the library is only useful for searching for a sequence in a long list and not, for instance, for looking up identifiers.

That is, I think construct should have type

construct’ :: (Ord a) => [[a]] -> STree a

where the constructor you have now is

construct l = construct’ (tails l)

]]>