Fast construction of wavelet trees - ScienceDirect Skip to main contentSkip to article
Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue …

We present new sequential and parallel algorithms for wavelet tree construction based on a
new bottom-up technique. This technique makes use of the structure of the wavelet trees …

The wavelet tree is a compact data structure that supports various types of operations on a
sequence of n integers in 0, σ). Although Munro et al.(SPIRE 2014 and Theoretical …

The wavelet tree is a flexible data structure that permits representing sequences S [1, n] of
symbols over an alphabet of size σ, within compressed space and supporting a wide range …

The wavelet tree has become a very useful data structure to efficiently represent and query
large volumes of data in many different domains, from bioinformatics to geographic …

Wavelet trees have become very useful to handle large data sequences efficiently. By the
same token, in the last decade, multicore architectures have become ubiquitous, and …

Existing parallel algorithms for wavelet tree construction have a work complexity of O (n log⁡
σ). This paper presents parallel algorithms for the problem with improved work complexity …

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 …

We present an improved wavelet tree construction algorithm and discuss its applications to a
number of rank/select problems for integer keys and strings. Given a string of length n over …

Wavelet trees are widely used in the representation of sequences, permutations, text
collections, binary relations, discrete points, and other succinct data structures. We show …