The wavelet tree is a versatile data structure that serves a number of purposes, from string
processing to computational geometry. It can be regarded as a device that represents a …

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 …

This thesis is devoted to internal queries in texts, which ask to solve classic text-processing
problems for substrings of a given text. More precisely, the task is to preprocess a static …

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 …

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 topic of this paper is the exploration of the various characteristics of the wavelet tree
data structure, a data structure that was initially proposed for text compression applications …

Parallelism is the key to achieving high performance in computing. However, writing efficient
and scalable parallel programs is notoriously difficult, and often requires significant …

The increasing use of geographic search engines manifests the interest of Internet users in
geo-located resources and, in general, in geographic information. This has emphasized the …

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 …