Comments on: Data Compression with the Burrows-Wheeler Transform

By: Discussion Of Burrows-Wheeler Transform Algorithm | Philips' Page O'Stuff

Discussion Of Burrows-Wheeler Transform Algorithm | Philips' Page O'Stuff — Wed, 08 Feb 2012 07:16:50 +0000

[...] a lot of better articles about this algorithm out there. I found Michael’s O’Stuff or Dr Dobb’s Journal is a good article so far. I highly recommend you to read them if you are serious studying about [...]

By: wsu123

wsu123 — Thu, 24 Nov 2011 19:07:12 +0000

Can anyone help me find the links for BWT Compression Algorithm code in MATLAB??

By: speedy

speedy — Tue, 06 Sep 2011 12:35:10 +0000

I AM TESTING BWT WITH MTF WHICH USES THE LOCALITY OF THE ALPH-BETICAL SET OF THE LAST COLUMN. THEREFORE bwt-mtf -> bwt-mtf MAY PRODUCE BETTER RESULTS. THEN lzw OR ARITHMETIC OR HUFFMAN IN THE FINAL!

By: Ericke

Ericke — Mon, 08 Aug 2011 04:32:25 +0000

Damn…..

Where the hell is my post about the link that i suggest…

Okay, it doesn’t matter mark…!!!

lol….

By: SPEEDY

SPEEDY — Mon, 18 Jul 2011 17:33:55 +0000

After reading the posts here, I think BWT can be understood in a much simpler way as follows:

1. the first sorted column is embedded in all columns
2. the adjacent relationships in rows are preserved in any permutations of the rows

3 two adjacent columns and an index to the original row are enough to decode. The last and first column are adjacent in the cyclic view.

4. sorting speed is important in the encoding

By: Mark Nelson

Mark Nelson — Mon, 17 Jan 2011 15:18:05 +0000

@Shoaib:

Google is your friend.

By: Shoaib

Shoaib — Sun, 16 Jan 2011 16:17:24 +0000

Or anyone who has doen it please let me know… would be of great help.

By: Shoaib

Shoaib — Sun, 16 Jan 2011 16:16:43 +0000

HI mark could you put up a java implementation?

By: Philips Telaumbanua

Philips Telaumbanua — Mon, 22 Nov 2010 04:09:45 +0000

Thank you Mark for response again!

Yeah, I just realized that the EOF character should be less than every characters in the block. So, it would reduce the comparison. In other words it wouldn’t continue the comparison if x or y = N (x or y = EOF), since EOF character always < other characters so the comparison can be terminated if one of them reached EOF. A good example is when we'd like to transform string "aaaaa$".

I think I've got the point.

Thank you very much Mark!

Ooo,,,I just want to tell you that your articles is very great, good written, neat, and clear. (article + source code = perfect). It has been a huge help.

Thank again Mark…

- Philips Tel

By: Mark Nelson

Mark Nelson — Sun, 21 Nov 2010 20:49:29 +0000

There is a big advantage to placing an EOF character at the end of the string. If the character is not found anywhere else in the input text, it means that you can use normal string compares to sort the strings – so instead of checking to see if the index wraps around at N, you can be guaranteed that the two strings won’t match when one index reaches N.

That speeds things up a lot, and it means you can use a native sort, which might even be faster.

The only disadvantage is that you have to take the EOF characters out of the block when you decompress. No problem.

I’d suggest continued study of the Burrows Wheeler suggestions for improving the sort speed, there is a lot of good in there.
- Mark