A Simpler Analysis of Burrows-Wheeler Based Compression.

Moshe Lewenstein, Gabriel Valiente, Haim Kaplan, Shir Landau, Elad Verbin

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review


In this paper we present a new technique for worst-case analysis of compression algorithms which are based on the Burrows-Wheeler Transform. We deal mainly with the algorithm purposed by Burrows and Wheeler in their first paper on the subject [6], called bw0. This algorithm consists of the following three steps: 1) Compute the Burrows-Wheeler transform of the text, 2) Convert the transform into a sequence of integers using the move-to-front algorithm, 3) Encode the integers using Arithmetic code or any order-0 encoding (possibly with run-length encoding). We prove a strong upper bound on the worst-case compression ratio of this algorithm. This bound is significantly better than bounds known to date and is obtained via simple analytical techniques. Specifically, we show that for any input string s, and μ> 1, the length of the compressed string is bounded by μ·s Hk(s) + log(ζ(μ)) ·s + gk where Hk is the k-th order empirical entropy, gk is a consta
Original languageEnglish
Title of host publicationCombinatorial Pattern Matching
PublisherSpringer Verlag
Pages282 - 293
Number of pages12
ISBN (Print)9783540354550
StatePublished - 2006
Event17th Annual Symposium on Combinatorial Pattern Matching, CPM 2006 - Barcelona, Spain
Duration: 5 Jul 20067 Jul 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4009 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference17th Annual Symposium on Combinatorial Pattern Matching, CPM 2006


Dive into the research topics of 'A Simpler Analysis of Burrows-Wheeler Based Compression.'. Together they form a unique fingerprint.

Cite this