Compressed Data Structures for Dynamic Sequences
From MaRDI portal
Publication:3452849
DOI10.1007/978-3-662-48350-3_74zbMath1466.68034arXiv1507.06866OpenAlexW2264090060MaRDI QIDQ3452849
Publication date: 19 November 2015
Published in: Algorithms - ESA 2015 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.06866
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05) Algorithms on strings (68W32)
Related Items (8)
Space-efficient B trees via load-balancing ⋮ Compressed dynamic range majority and minority data structures ⋮ Finding modes with equality comparisons ⋮ Random access in persistent strings and segment selection ⋮ Unnamed Item ⋮ A faster implementation of online RLBWT and its application to LZ77 parsing ⋮ Unnamed Item ⋮ Faster online computation of the succinct longest previous factor array
Cites Work
- Succinct data structures for searchable partial sums with optimal worst-case performance
- Dynamic rank/select structures with applications to run-length encoded texts
- Fully Functional Static and Dynamic Succinct Trees
- CRAM: Compressed Random Access Memory
- New Lower and Upper Bounds for Representing Sequences
- Compressed representations of sequences and full-text indexes
- Compressed indexes for dynamic text collections
- Alphabet Partitioning for Compressed Rank/Select and Applications
- Succinct indexes for strings, binary relations and multilabeled trees
- An analysis of the Burrows—Wheeler transform
- Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts
- Rank/select operations on large alphabets
- Optimal External Memory Interval Management
- Optimal Dynamic Sequence Representations
- Algorithms and Computation
- Dynamic Entropy-Compressed Sequences and Full-Text Indexes
- Combinatorial Pattern Matching
- Dynamic Compressed Strings with Random Access
- A Framework for Dynamizing Succinct Data Structures
- Unnamed Item
- Unnamed Item
This page was built for publication: Compressed Data Structures for Dynamic Sequences
