Loading...
Nearly Tight Bounds on the Encoding Length of the Burrows-Wheeler Transform (Extended Abstract)
Gupta, Ankur Grossi, Roberto Vitter, Jeffrey Scott
Gupta, Ankur
Grossi, Roberto
Vitter, Jeffrey Scott
Citations
Altmetric:
Abstract
In this paper, we present a nearly tight analysis of the encoding length of the Burrows-Wheeler Transform (bwt) that is motivated by the text indexing setting.For a text T of n symbols drawn from an alphabet , our encoding scheme achieves bounds in terms of the hth-order empirical entropy Hh of the text, and takes linear time for encoding and decoding. We also describe a lower bound on the encoding length of the bwt that constructs an in nite (non-trivial) class of texts that are among the hardest to compress using the bwt. We then show that our upper bound encoding length is nearly tight with this lower bound
for the class of texts we described.
In designing our bwt encoding and its lower
bound, we also address the t-subset problem; here,
the goal is to store a subset of t items drawn from a
universe [1
Description
Date
2008-01
Journal Title
Journal ISSN
Volume Title
Publisher
Society for Industrial and Applied Mathematics
Files
Loading...
anl08_018guptaa.pdf
Adobe PDF, 1.13 MB
Research Projects
Organizational Units
Journal Issue
Keywords
Citation
R. Grossi, A. Gupta, and J. S. Vitter. “Nearly Tight Bounds on the Encoding Length of the Burrows-Wheeler Transform,” in preparation. An extended abstract appears in Proceedings of the 5th Workshop on Analytical Algorithmics and Combinatorics (ANALCO ’08), San Francisco, CA, January 2008, 191–202