BWT
BWT stands for Burrows–Wheeler transform, a reversible data transformation introduced by Michael Burrows and David Wheeler in 1994. It rearranges a string into a form that tends to group identical characters together, making the data more amenable to entropy coding and compression.
The transform operates on a string s of length n that includes a unique end-of-string symbol (often
Inverting the transform is possible using the last-to-first (LF) mapping, which links characters in L to their
Usage in compression and indexing: The BWT itself does not compress data; it tends to produce runs
Variants and notes: BWT can be applied to alphabets of various sizes, and while it is invertible