burrows-wheeler transform

The Burrows-Wheeler transform is a reversible text transformation algorithm that rearranges characters in a string to improve their compressibility, making them easier to compress. The transformation works by creating a matrix of all possible cyclic rotations of the string, sorting the rows of the matrix lexicographically, and then taking the last column of the sorted matrix as the transformed string. The transformed string retains all the information of the original string while often containing long consecutive runs of the same character sequences, providing an efficient way to perform compression and indexing.

Explore

Requires login.