+The Burrows-Wheeler Transform (BWT) reorders a string of characters, grouping identical symbols together without losing information. This reversible block-sorting transform does not compress data directly, but creates a more easily compressible output for subsequent algorithms like [Run-length Encoding](/wiki/run_length_encoding) or [Huffman Coding](/wiki/huffman_coding).
+## See also
+- [Data Compression](/wiki/data_compression)
+- [Text Compression](/wiki/text_compression)
+- [Suffix Array](/wiki/suffix_array)
... 1 more lines