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. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Tischler, G. (2011). On wavelet tree construction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6661 LNCS, pp. 208–218). https://doi.org/10.1007/978-3-642-21458-5_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
