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 or Huffman Coding.