Burrows-Wheeler Transform

The Burrows-Wheeler transform rearranges a character string into runs of similar characters. This is useful for compression, since repeated character runs are easier to compress with techniques like move-to-front transform and run-length encoding. More importantly, the transformation is reversible without needing to store additional data except the position of the first original character.