Wavelet Tree
The Wavelet Tree is a succinct data structure to store strings in compressed space. It generalizes the and operations defined on bitvectors to arbitrary alphabets. Originally introduced to represent compressed suffix arrays, it has found application in several contexts. The tree is defined by recursively partitioning the alphabet into pairs of subsets; the leaves correspond to individual symbols of the alphabet, and at each node a bitvector stores whether a symbol of the string belongs to one subset or the other.
Wikipage redirect
Link from a Wikipage to another Wikipage
primaryTopic
Wavelet Tree
The Wavelet Tree is a succinct data structure to store strings in compressed space. It generalizes the and operations defined on bitvectors to arbitrary alphabets. Originally introduced to represent compressed suffix arrays, it has found application in several contexts. The tree is defined by recursively partitioning the alphabet into pairs of subsets; the leaves correspond to individual symbols of the alphabet, and at each node a bitvector stores whether a symbol of the string belongs to one subset or the other.
has abstract
In der Informatik versteht man ...... cken der relationalen Algebra.
@de
The Wavelet Tree is a succinct ...... and high-frequency components.
@en
Un arbre d'ondelettes (en angl ...... e fréquences basses et hautes.
@fr
Link from a Wikipage to an external page
Wikipage page ID
36,038,546
page length (characters) of wiki page
Wikipage revision ID
857,342,768
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
comment
In der Informatik versteht man ...... cken der relationalen Algebra.
@de
The Wavelet Tree is a succinct ...... gs to one subset or the other.
@en
Un arbre d'ondelettes (en angl ...... e fréquences basses et hautes.
@fr
label
Arbre d'ondelettes
@fr
Wavelet Tree
@de
Wavelet Tree
@en