Efficient fully-compressed sequence representations
From MaRDI portal
Recommendations
- Compressed representations of sequences and full-text indexes
- Efficient Compression of Long Arbitrary Sequences With No Reference at the Encoder
- Compressed Data Structures for Dynamic Sequences
- On compressing and indexing repetitive sequences
- A universal algorithm for sequential data compression
- Fully-Compressed Suffix Trees
- Fully compressed suffix trees
- Faster subsequence recognition in compressed strings
- Efficient reconstruction of sequences
- Superior guarantees for sequential prediction and lossless compression via alphabet decomposition
Cites work
- scientific article; zbMATH DE number 3614186 (Why is no real title available?)
- scientific article; zbMATH DE number 2079421 (Why is no real title available?)
- scientific article; zbMATH DE number 756768 (Why is no real title available?)
- scientific article; zbMATH DE number 1445373 (Why is no real title available?)
- A Method for the Construction of Minimum-Redundancy Codes
- A simple storage scheme for strings achieving entropy bounds
- Adaptive searching in succinctly encoded binary relations and tree-structured documents
- Alphabet-independent compressed text indexing
- An analysis of the Burrows-Wheeler transform
- An experimental investigation of set intersection algorithms for text searching
- Approximate string matching with compressed indexes
- Cell probe lower bounds for succinct data structures
- Compact rich-functional binary relation representations
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Compressed representations of permutations, and applications
- Compressed representations of sequences and full-text indexes
- Compressing and indexing labeled trees, with applications
- Dynamic entropy-compressed sequences and full-text indexes
- Extended compact web graph representations
- Indexing compressed text
- More haste, less waste: lowering the redundancy in fully indexable dictionaries
- New lower and upper bounds for representing sequences
- New text indexing functionalities of the compressed suffix arrays
- On compressing permutations and adaptive sorting
- On the Redundancy of Succinct Data Structures
- On the Size of Succinct Indices
- Optimal lower bounds for rank and select indexes
- Optimal trade-offs for succinct string indexes
- Practical entropy-compressed rank/select dictionary
- Rank and select revisited and extended
- Rank/select operations on large alphabets
- Sorting shuffled monotone sequences
- Squeezing succinct data structures into entropy bounds
- Statistical Encoding of Succinct Data Structures
- Storing a Compressed Function with Constant Time Access
- Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
- Succinct indexes for strings, binary relations and multilabeled trees
- Succinct representations of permutations and functions
- Worst-Case Optimal Adaptive Prefix Coding
- Worst-case Analysis of Set Union Algorithms
Cited in
(20)- Random access in persistent strings and segment selection
- Fast compressed self-indexes with deterministic linear-time construction
- Compressed string dictionary search with edit distance one
- High-order entropy compressed bit vectors with rank/select
- Grammar compressed sequences with rank/select support
- Compressed Data Structures for Dynamic Sequences
- Computing and Combinatorics
- From time to space: fast algorithms that yield small and fast data structures
- More haste, less waste: lowering the redundancy in fully indexable dictionaries
- Lyndon array construction during Burrows-Wheeler inversion
- Compressed depth sequences
- Alphabet partitioning for compressed rank/select and applications
- New lower and upper bounds for representing sequences
- Fast Compressed Self-Indexes with Deterministic Linear-Time Construction
- Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
- Compressed spaced suffix arrays
- Range majorities and minorities in arrays
- scientific article; zbMATH DE number 7765406 (Why is no real title available?)
- Succinct navigational oracles for families of intersection graphs on a circle
- A practical alphabet-partitioning rank/select data structure
This page was built for publication: Efficient fully-compressed sequence representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q472482)
