0000000001172228
AUTHOR
P Ferragina
The Myriad Virtes of Wavelet Trees
A new data structure, the wavelet tree, is analysied and discussed with particular attention to data compression
2D-Pattern Indexing
Data Structures for two-dimensional pattern matching are presented and discussed.
The Myriad Virtues of Suffix Trees
Wavelet Trees have been introduced in [Grossi, Gupta and Vitter, SODA ’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 (lik…