Translating Between Wavelet Tree and Wavelet Matrix Construction

02/19/2020
by   Patrick Dinklage, et al.
0

The wavelet tree (Grossi et al. [SODA, 2003]) and wavelet matrix (Claude et al. [Inf. Syst., 2015]) are compact data structures with many applications such as text indexing or computational geometry. By continuing the recent research of Fischer et al. [ALENEX, 2018], we explore the similarities and differences of these heavily related data structures with focus on their construction. We develop a data structure to modify construction algorithms for either the wavelet tree or matrix to construct instead the other. This modification is efficient, in that it does not worsen the asymptotic time and space requirements of any known wavelet tree or wavelet matrix construction algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/08/2019

String Synchronizing Sets: Sublinear-Time BWT Construction and Optimal LCE Data Structure

Burrows-Wheeler transform (BWT) is an invertible text transformation tha...
research
06/13/2020

Historical traffic flow data reconstrucion applying Wavelet Transform

Despite the importance of fundamental parameters (traffic flow, density ...
research
01/29/2019

Online Algorithms for Constructing Linear-size Suffix Trie

The suffix trees are fundamental data structures for various kinds of st...
research
02/18/2023

Faster Wavelet Trees with Quad Vectors

Given a text, rank and select queries return the number of occurrences o...
research
05/12/2023

Matching Statistics speed up BWT construction

Due to the exponential growth of genomic data, constructing dedicated da...
research
11/01/2022

Wavelet Neural Networks versus Wavelet-based Neural Networks

This is the first paper in a sequence of studies in which we introduce a...
research
12/07/2015

On The Continuous Steering of the Scale of Tight Wavelet Frames

In analogy with steerable wavelets, we present a general construction of...

Please sign up or login with your details

Forgot password? Click here to reset