Random access in persistent strings and segment selection
From MaRDI portal
Publication:6174650
DOI10.1007/s00224-022-10109-5arXiv2006.15575OpenAlexW3129037412MaRDI QIDQ6174650
Publication date: 17 August 2023
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.15575
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient fully-compressed sequence representations
- Succinct data structures for searchable partial sums with optimal worst-case performance
- A simple storage scheme for strings achieving entropy bounds
- Making data structures persistent
- Surpassing the information theoretic bound with fusion trees
- Trans-dichotomous algorithms for minimum spanning trees and shortest paths
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- Time-space trade-offs for Lempel-Ziv compressed indexing
- Dynamic relative compression, dynamic partial sums, and substring concatenation
- Approximate pattern matching in LZ77-compressed texts
- Tree compression with top trees
- Fast relative Lempel-Ziv self-index for similar sequences
- Document listing on repetitive collections with guaranteed performance
- Indexing Highly Repetitive Collections
- An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries
- A Faster Grammar-Based Self-index
- Persistent Predecessor Search and Orthogonal Point Location on the Word RAM
- Compressed representations of sequences and full-text indexes
- A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time
- Relative Lempel-Ziv Compression of Genomes for Large-Scale Storage and Retrieval
- Access, Rank, and Select in Grammar-compressed Strings
- Compressed Data Structures for Dynamic Sequences
- On the Redundancy of Succinct Data Structures
- The Smallest Grammar Problem
- Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time
- Rank/select operations on large alphabets
- Squeezing succinct data structures into entropy bounds
- Filtering Search: A New Approach to Query-Answering
- Data compression via textual substitution
- A universal algorithm for sequential data compression
- Two-Dimensional and Three-Dimensional Point Location in Rectangular Subdivisions
- Document Listing on Repetitive Collections
- Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings
- Optimal Lower and Upper Bounds for Representing Sequences
- Balancing Straight-line Programs
- Succinct Partial Sums and Fenwick Trees
- At the roots of dictionary compression: string attractors
- Random Access to Grammar-Compressed Strings and Trees
- Dynamic Compressed Strings with Random Access
- The macro model for data compression (Extended Abstract)
- LZ77-Based Self-indexing with Faster Pattern Matching
- Logarithmic Lower Bounds in the Cell-Probe Model
- Random access in persistent strings and segment selection
This page was built for publication: Random access in persistent strings and segment selection
