Skip to main content

and
  1. No Access

    Chapter

    Space Efficient Linear Time Computation of the Burrows and Wheeler-Transformation

    In [4] a universal data compression algorithm (BW-algorithm, for short) is described which achieves compression rates that are close to the best known rates achieved in practice. Due to its simplicity, the alg...

    Stefan Kurtz, Bernhard Balkenhol in Numbers, Information and Complexity (2000)