Rank/select on dynamic compressed sequences and applications
type: Item
instance of: scholarly article
title: Rank/select on dynamic compressed sequences and applications
zbMATH Open document ID: 1194.68103
author: Gonzalo Navarro
author: Rodrigo González
published in: Theoretical Computer Science
publication date: 2009-10-09T00:00:00Z
full work available at URL: http://hdl.handle.net/10533/141035
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 5612529
zbMATH Keywords: compressed data structures
zbMATH Keywords: empirical entropy
zbMATH Keywords: text indexing
MaRDI profile type: Publication
OpenAlex ID: W2151127969
cites work: Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents
cites work: Q2934653
cites work: Q5501237
cites work: Compressed indexes for dynamic text collections
cites work: Combinatorial Pattern Matching
cites work: Introduction to algorithms
cites work: Compressed representations of sequences and full-text indexes
cites work: A simple storage scheme for strings achieving entropy bounds
cites work: When indexing equals compression
cites work: Rank/select operations on large alphabets
cites work: Q4471381
cites work: A Framework for Dynamizing Succinct Data Structures
cites work: A space and time efficient algorithm for constructing compressed suffix arrays
cites work: Algorithms and Computation
cites work: Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts
cites work: Dynamic entropy-compressed sequences and full-text indexes
cites work: Suffix Arrays: A New Method for On-Line String Searches
cites work: An analysis of the Burrows—Wheeler transform
cites work: Logarithmic Lower Bounds in the Cell-Probe Model
cites work: Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
cites work: Q4449188
cites work: Squeezing succinct data structures into entropy bounds
DOI: 10.1016/J.TCS.2009.07.022
description: scientific article; zbMATH DE number 5612529