<ul><li>The Burrows-Wheeler transform (BWT) permutes text in order to make it more compressible by exploiting repetition.</li><li>The BWT lists all the rotations of a string, sorts the table, and takes the last column as the transform value.</li><li>The BWT rearranges text in a way that makes run-length encoding more efficient.</li><li>The BWT is reversible and tends to cluster similar letters together, making it suitable for compressing natural language text.</li></ul>

Preprocessing text to make it more compressible

Discover more