@inbook{40cbdebd5cef4f09aa1b14d261d38873,
title = "The Myriad Virtues of Suffix Trees",
abstract = "Wavelet Trees have been introduced in [Grossi, Gupta and Vitter, SODA {\textquoteright}03] and have been rapidly recognized as a very flexible tool for the design of compressed full-text indexes and data compressors. Although several papers have investigated the beauty and usefulness of this data structure in the full-text indexing scenario, its impact on data compression has not been fully explored. In this paper we provide a complete theoretical analysis of a wide class of compression algorithms based on Wavelet Trees. We also show how to improve their asymp- totic performance by introducing a novel framework, called Generalized Wavelet Trees, that aims for the best combination of binary compressors (like, Run-Length encoders) versus non-binary compressors (like, Huff- man and Arithmetic encoders) and Wavelet Trees of properly-designed shapes. As a corollary, we prove high-order entropy bounds for the chal lenging combination of Burrows-Wheeler Transform and Wavelet Trees.",
keywords = "Algorithms, Data Compression, Algorithms, Data Compression",
author = "Raffaele Giancarlo and Paolo Ferragina and Giovanni Manzini",
year = "2006",
language = "English",
series = "LNCS",
pages = "560--571",
booktitle = "LECTURE NOTES IN COMPUTER SCIENCE",
}