Wavelet trees for all
From MaRDI portal
Publication:2442812
Recommendations
Cites work
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- A Method for the Construction of Minimum-Redundancy Codes
- A Primer on Wavelets and Their Scientific Applications
- A Space-Economical Suffix Tree Construction Algorithm
- Alphabet partitioning for compressed rank/select and applications
- Alphabet-independent compressed text indexing
- An analysis of the Burrows-Wheeler transform
- An experimental investigation of set intersection algorithms for text searching
- Bidirectional search in a string with wavelet trees
- Boosting textual compression in optimal linear time
- Cell-probe lower bounds for succinct partial sums
- Compact binary relation representations with rich functionality
- Compact rich-functional binary relation representations
- Compressed indexes for dynamic text collections
- Compressed representations of permutations, and applications
- Compressed representations of sequences and full-text indexes
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- Compressed Text Indexes with Fast Locate
- Counting Colours in Compressed Strings
- Efficient Data Structures for the Orthogonal Range Successor Problem
- Entropy-bounded representation of point grids
- Extended compact web graph representations
- Fast and Compact Prefix Codes
- Fully functional static and dynamic succinct trees
- scientific article; zbMATH DE number 5485435 (Why is no real title available?)
- scientific article; zbMATH DE number 3913711 (Why is no real title available?)
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 1303857 (Why is no real title available?)
- scientific article; zbMATH DE number 2079421 (Why is no real title available?)
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- scientific article; zbMATH DE number 2119724 (Why is no real title available?)
- scientific article; zbMATH DE number 1438578 (Why is no real title available?)
- scientific article; zbMATH DE number 6469201 (Why is no real title available?)
- scientific article; zbMATH DE number 2230164 (Why is no real title available?)
- Indexing compressed text
- Indexing text using the Ziv--Lempel trie
- New algorithms on wavelet trees and applications to information retrieval
- New lower and upper bounds for representing sequences
- On compressing permutations and adaptive sorting
- On the Size of Succinct Indices
- On wavelet tree construction
- Optimal Lower Bounds for Rank and Select Indexes
- Optimal lower bounds for rank and select indexes
- Optimal succinctness for range minimum queries
- Orthogonal range searching on the RAM, revisited
- Position-Restricted Substring Searching
- Practical entropy-compressed rank/select dictionary
- Range selection and median: tight cell probe lower bounds and adaptive data structures
- Rank and select revisited and extended
- Rank/select operations on large alphabets
- Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
- Self-indexed grammar-based compression
- Self-indexing based on LZ77
- Space-Efficient Algorithms for Document Retrieval
- Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
- Space-efficient data-analysis queries on grids
- String Processing and Information Retrieval
- Succinct Indexable Dictionaries with Applications to Encoding k-ary Trees, Prefix Sums and Multisets
- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
- Suffix Arrays: A New Method for On-Line String Searches
- The myriad virtues of wavelet trees
- Top-\(k\) ranked document search in general text databases
Cited in
(37)- Practical space-efficient index for structural pattern matching
- Using compressed suffix-arrays for a compact representation of temporal-graphs
- Space-efficient construction of compressed suffix trees
- Simpler FM-index for parameterized string matching
- Space-efficient fully dynamic DFS in undirected graphs
- Computing the Burrows-Wheeler transform in place and in small space
- The myriad virtues of wavelet trees
- Parallel lightweight wavelet tree, suffix array and FM-index construction
- Range selection and predecessor queries in data aware space and time
- Grammar compressed sequences with rank/select support
- Document listing on repetitive collections with guaranteed performance
- Grammar-compressed indexes with logarithmic search time
- Succinct encodings for families of interval graphs
- Wavelet trees for all
- Compressed matching for feature vectors
- Fast construction of wavelet trees
- A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs
- On wavelet tree construction
- Wavelet analysis on symbolic sequences and two-fold de Bruijn sequences
- The Myriad Virtues of Wavelet Trees
- New algorithms on wavelet trees and applications to information retrieval
- String attractors: verification and optimization
- Space-efficient computation of the LCP array from the Burrows-Wheeler transform
- Practical Wavelet Tree Construction
- Structural Pattern Matching - Succinctly.
- A self-index on block trees
- Efficient and compact representations of some non-canonical prefix-free codes
- Compact representations of spatial hierarchical structures with support for topological queries
- A practical alphabet-partitioning rank/select data structure
- The ring: worst-case optimal joins in graph databases using (almost) no extra space
- Space-efficient conversions from SLPs
- Encodings for range minimum queries over bounded alphabets
- Breaking a barrier in constructing compact indexes for parameterized pattern matching
- (Worst-case) optimal adaptive dynamic bitvectors
- Succinct preferential-attachment graphs
- Counting on general run-length grammars
- Encodings for range minimum queries over bounded alphabets
This page was built for publication: Wavelet trees for all
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2442812)
