On Wavelet Tree Construction
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.
Unable to display preview. Download preview PDF.
- 5.Grossi, R., Gupta, A., Vitter, J.S.: High-order entropy-compressed text indexes. In: SODA, pp. 841–850 (2003)Google Scholar