Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts

DOI10.1007/978-3-540-73437-6_12zbMath1138.68418OpenAlexW2100907505MaRDI QIDQ3506912

Sunho Lee, Kun Soo Park

Publication date: 17 June 2008

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73437-6_12

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items

Fast construction of wavelet trees ⋮ Compressed Data Structures for Dynamic Sequences ⋮ Approximate string matching with compressed indexes ⋮ An Online Algorithm for Finding the Longest Previous Factors ⋮ Fast compressed self-indexes with deterministic linear-time construction ⋮ Rank/select on dynamic compressed sequences and applications