On Thu, 23 Jun 2011, larry.liuxinyu wrote:
I think that version is still a brute-force solution. The only difference is
that it uses EOF (sentinel) so that it can sort the
suffixes instead of rotations.
However, the big-O complexity is the same.
Let's take the rbwt for example:
rbwt xs =
On Wed, 22 Jun 2011, larry.liuxinyu wrote:
Hi,
I read a previous thread about BWT implementation in Haskell:
http://www.mail-archive.com/haskell-cafe@haskell.org/msg25609.html
and
http://sambangu.blogspot.com/2007/01/burrows-wheeler-transform-in-haskell
They are all in a `brute-force' way,
Hi,
I think that version is still a brute-force solution. The only difference is
that it uses EOF (sentinel) so that it can sort the suffixes instead of
rotations.
However, the big-O complexity is the same.
Let's take the rbwt for example:
rbwt xs = let
res = sortBy (\(a:as) (b:bs) - a
Hi,
I read a previous thread about BWT implementation in Haskell:
http://www.mail-archive.com/haskell-cafe@haskell.org/msg25609.html
and
http://sambangu.blogspot.com/2007/01/burrows-wheeler-transform-in-haskell
They are all in a `brute-force' way, that is implement based on
Burrows-Wheeler's
