On wavelet tree construction

Authors:
German Tischler
Affiliations:
Institut für Informatik, Universität Würzburg, Würzburg, Germany
Venue:
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Year:
2011

Citing 7
Cited 4

Simplified stable merging tasks

Journal of Algorithms
High-order entropy-compressed text indexes

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Linear work suffix array construction

Journal of the ACM (JACM)
Rank and select revisited and extended

Theoretical Computer Science
The myriad virtues of Wavelet Trees

Information and Computation
Range Quantile Queries: Another Virtue of Wavelet Trees

SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Radix sorting with no extra space

ESA'07 Proceedings of the 15th annual European conference on Algorithms

Wavelet trees for all

CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
The wavelet matrix

SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Space-efficient representations of rectangle datasets supporting orthogonal range querying

Information Systems
Wavelet trees for all

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

The wavelet tree is a compact data structure allowing fast rank, select, access and other queries on non binary sequences. It has many applications in indexed pattern matching and data compression. In contrast to applications of wavelet trees their construction has so far been paid little attention. In this paper we discuss time and space efficient algorithms for constructing wavelet trees.