Rank/select on dynamic compressed sequences and applications
From MaRDI portal
Publication:732036
DOI10.1016/j.tcs.2009.07.022zbMath1194.68103OpenAlexW2151127969MaRDI QIDQ732036
Gonzalo Navarro, Rodrigo A. González
Publication date: 9 October 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/141035
Related Items (8)
Fast construction of wavelet trees ⋮ Space-efficient B trees via load-balancing ⋮ Space efficient data structures for dynamic orthogonal range counting ⋮ Space-efficient data-analysis queries on grids ⋮ Counting Colours in Compressed Strings ⋮ Space-efficient construction of Lempel-Ziv compressed text indexes ⋮ Fully Functional Static and Dynamic Succinct Trees ⋮ Succinct and Implicit Data Structures for Computational Geometry
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple storage scheme for strings achieving entropy bounds
- A space and time efficient algorithm for constructing compressed suffix arrays
- When indexing equals compression
- Compressed representations of sequences and full-text indexes
- Compressed indexes for dynamic text collections
- Suffix Arrays: A New Method for On-Line String Searches
- An analysis of the Burrows—Wheeler transform
- Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts
- Rank/select operations on large alphabets
- Squeezing succinct data structures into entropy bounds
- Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
- Dynamic entropy-compressed sequences and full-text indexes
- Algorithms and Computation
- Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents
- Combinatorial Pattern Matching
- A Framework for Dynamizing Succinct Data Structures
- Logarithmic Lower Bounds in the Cell-Probe Model
This page was built for publication: Rank/select on dynamic compressed sequences and applications
