[HTML][HTML] Parallel lightweight wavelet tree, suffix array and FM-index construction
We present parallel lightweight algorithms to construct wavelet trees, rank and select
structures, and suffix arrays in a shared-memory setting. The work and depth of our first …
structures, and suffix arrays in a shared-memory setting. The work and depth of our first …
Practical wavelet tree construction
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 …
new bottom-up technique. This technique makes use of the structure of the wavelet trees …
[HTML][HTML] Improved parallel construction of wavelet trees and rank/select structures
J Shun - Information and computation, 2020 - Elsevier
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 …
σ). This paper presents parallel algorithms for the problem with improved work complexity …
[PDF][PDF] Faster wavelet trees with quad vectors
M Ceregini, F Kurpicz, R Venturini - CoRR, abs/2302.09239, 2023 - kurpicz.org
Given a text, rank and select queries return the number of occurrences of a character up to a
position (rank) or the position of a character with a given rank (select). These queries have …
position (rank) or the position of a character with a given rank (select). These queries have …
Faster Block Tree Construction
The block tree [Belazzougui et al. J. Comput. Syst. Sci.'21] is a compressed text index that
can answer access (extract a character at a position), rank (number of occurrences of a …
can answer access (extract a character at a position), rank (number of occurrences of a …
Fast wavelet tree construction in practice
Y Kaneta - International Symposium on String Processing and …, 2018 - Springer
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 …
sequence of n integers in 0, σ). Although Munro et al.(SPIRE 2014 and Theoretical …
Simple, fast and lightweight parallel wavelet tree construction
The wavelet tree (Grossi et al.[SODA, 2003]) and wavelet matrix (Claude et al.[Inf. Syst., 47:
15–32, 2015]) are compact indices for texts over an alphabet [0, σ) that support rank, select …
15–32, 2015]) are compact indices for texts over an alphabet [0, σ) that support rank, select …
Scalable thread based index construction using wavelet tree
Indexing is one of the key components of any search tool to be optimized for searching
documents. Among the existing indexing techniques, inverted indexing is one of the best …
documents. Among the existing indexing techniques, inverted indexing is one of the best …
Parallel external memory wavelet tree and wavelet matrix construction
We present the first parallel external memory wavelet tree and matrix construction algorithm.
The algorithm's throughput is nearly the same as the hard disk drives' throughput, using six …
The algorithm's throughput is nearly the same as the hard disk drives' throughput, using six …
Constructing the wavelet tree and wavelet matrix in distributed memory
The wavelet tree (Grossi et al.[SODA, 2003]) is a compact index for texts that provides rank,
select, and access operations. This leads to many applications in text indexing …
select, and access operations. This leads to many applications in text indexing …