23 Jun
2011
23 Jun
'11
10:50 p.m.
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, that is implement based on Burrows-Wheeler's definition like below:
I thought that the knot-tying solution by Bertram Felgenhauer in the same thread was both elegant and efficient: http://www.mail-archive.com/haskell-cafe%40haskell.org/msg25692.html