Practical entropy-compressed rank/select dictionary
From MaRDI portal
Recommendations
Cited in
(53)- Practical compressed suffix trees
- High-order entropy compressed bit vectors with rank/select
- Fixed block compression boosting in FM-indexes: theory and practice
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations
- Approximate query processing over static sets and sliding windows
- Applications of non-uniquely decodable codes to privacy-preserving high-entropy data representation
- New space/time tradeoffs for top-\(k\) document retrieval on sequences
- Faster compressed quadtrees
- Optimal skeleton and reduced Huffman trees
- Accelerated partial decoding in wavelet trees
- DenseZDD: a compact and fast index for families of sets
- Improved and extended locating functionality on compressed suffix arrays
- Block graphs in practice
- Range selection and predecessor queries in data aware space and time
- A space efficient direct access data structure
- Algorithms to compute the Burrows-Wheeler similarity distribution
- Wavelet trees for all
- Document listing on repetitive collections with guaranteed performance
- Space efficient data structures for nearest larger neighbor
- Grammar-compressed indexes with logarithmic search time
- Optimal encodings for range majority queries
- Locally compressed suffix arrays
- Fast compressed tries through path decompositions
- General document retrieval in compact space
- Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts
- Entropy-bounded representation of point grids
- Colored range queries and document retrieval
- New algorithms on wavelet trees and applications to information retrieval
- Better external memory LCP array construction
- Efficient fully-compressed sequence representations
- Optimal indexes for sparse bit vectors
- Efficient dynamic range minimum query
- Simple and efficient fully-functional succinct trees
- Haplotype-aware graph indexes
- Approximate query processing over static sets and sliding windows
- Efficient compression and indexing of trajectories
- Faster practical block compression for rank/select dictionaries
- Optimal skeleton Huffman trees
- A self-index on block trees
- Practical compact indexes for top-k document retrieval
- Compressed Dictionaries: Space Measures, Data Sets, and Experiments
- Space-efficient construction of Lempel-Ziv compressed text indexes
- Experimental and Efficient Algorithms
- A Learned Approach to Design Compressed Rank/Select Data Structures
- Efficient construction of the BWT for repetitive text using string compression
- An index for sequencing reads based on the colored de Bruijn graph
- Faster dynamic compressed \(d\)-ary relations
- A practical alphabet-partitioning rank/select data structure
- Adaptive succinctness
- Randomized data partitioning with efficient search, retrieval and privacy-preservation
- (Worst-case) optimal adaptive dynamic bitvectors
- Grammar index by induced suffix sorting
- Compact and succinct data structures for multidimensional orthogonal range searching
This page was built for publication: Practical entropy-compressed rank/select dictionary
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5233491)
