[Haskell-cafe] Re: [ANN] An efficient lazy suffix tree library

Bryan O'Sullivan bos at serpentine.com
Mon Aug 27 14:38:33 EDT 2007

ChrisK wrote:

> That is almost certainly because the algorithm expects the source string to have
> a unique character at its end.

Chris is correct.  I'll ensure that the docs make this clear.


More information about the Haskell-Cafe mailing list