A simple storage scheme for strings achieving entropy bounds
From MaRDI portal
Recommendations
- A simple storage scheme for strings achieving entropy bounds
- Compression of Low Entropy Strings with Lempel--Ziv Algorithms
- On the complexity of random strings
- Succinct randomized encodings and their applications
- An upper bound on the entropy of run-length coding (Corresp.)
- Simple Compression Code Supporting Random Access and Fast String Matching
- Random access to high-order entropy compressed text
- Limits on the computational power of random strings
- Limits on the Computational Power of Random Strings
Cites work
- scientific article; zbMATH DE number 2079421 (Why is no real title available?)
- scientific article; zbMATH DE number 756768 (Why is no real title available?)
- An analysis of the Burrows-Wheeler transform
- Boosting textual compression in optimal linear time
- Compression of individual sequences via variable-rate coding
- Indexing compressed text
- New text indexing functionalities of the compressed suffix arrays
- Optimal Lower Bounds for Rank and Select Indexes
- Squeezing succinct data structures into entropy bounds
- Succinct Indexable Dictionaries with Applications to Encoding k-ary Trees, Prefix Sums and Multisets
- Succinct indexes for strings, binary relations and multi-labeled trees
- Ultra-succinct representation of ordered trees
Cited in
(35)- Random access in persistent strings and segment selection
- Optimal indexes for sparse bit vectors
- Fast compressed self-indexes with deterministic linear-time construction
- Robust transmission of unbounded strings using Fibonacci representations
- Colored range queries and document retrieval
- Ultra-succinct representation of ordered trees with applications
- Block trees
- Compressed string dictionary search with edit distance one
- Access, rank, and select in grammar-compressed strings
- Fast entropy-bounded string dictionary look-up with mismatches
- Bounds from a card trick
- Efficient fully-compressed sequence representations
- A space efficient direct access data structure
- Compressing dictionary matching index via sparsification technique
- Succinct 2D dictionary matching
- A simple storage scheme for strings achieving entropy bounds
- Dynamic rank/select structures with applications to run-length encoded texts
- Rank/select on dynamic compressed sequences and applications
- Rank and select revisited and extended
- Wee LCP
- Fast string dictionary lookup with one error
- Random access to high-order entropy compressed text
- On compact representations of all-pairs-shortest-path-distance matrices
- A framework for succinct labeled ordinal trees over large alphabets
- Can we locally compute sparse connected subgraphs?
- Range majorities and minorities in arrays
- Compressed dynamic range majority and minority data structures
- Accelerated partial decoding in wavelet trees
- scientific article; zbMATH DE number 7765406 (Why is no real title available?)
- Compressed text indexing with wildcards
- scientific article; zbMATH DE number 7559179 (Why is no real title available?)
- On representing the degree sequences of sublogarithmic-degree Wheeler graphs
- Succinct data structures for nearest colored node in a tree
- Dynamic relative compression, dynamic partial sums, and substring concatenation
- Path queries on functions
This page was built for publication: A simple storage scheme for strings achieving entropy bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870846)
