Dynamic rank/select structures with applications to run-length encoded texts
type: Item
instance of: scholarly article
title: Dynamic rank/select structures with applications to run-length encoded texts
zbMATH Open document ID: 1181.68121
author: Sunho Lee
author: Kunsoo Park
published in: Theoretical Computer Science
publication date: 2009-10-09T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68P30
Mathematics Subject Classification ID: 68W32
zbMATH DE Number: 5612528
zbMATH Keywords: succinct data structures
zbMATH Keywords: dynamic rank/select structures
zbMATH Keywords: full-text index
zbMATH Keywords: run-length encoding
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.07.021
OpenAlex ID: W2112179489
cites work: Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
cites work: New text indexing functionalities of the compressed suffix arrays
cites work: Squeezing succinct data structures into entropy bounds
cites work: A simple storage scheme for strings achieving entropy bounds
cites work: An analysis of the Burrows—Wheeler transform
cites work: Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
cites work: On the Size of Succinct Indices
cites work: Compressed representations of sequences and full-text indexes
cites work: Q4471381
cites work: Rank/select operations on large alphabets
cites work: Q2934653
cites work: Combinatorial Pattern Matching
cites work: Q4778577
cites work: Algorithms and Computation
cites work: Dynamic Entropy-Compressed Sequences and Full-Text Indexes
cites work: A Framework for Dynamizing Succinct Data Structures
cites work: Improved Dynamic Rank-Select Entropy-Bound Structures
cites work: Dynamic entropy-compressed sequences and full-text indexes
DOI: 10.1016/J.TCS.2009.07.021
description: scientific article; zbMATH DE number 5612528