Dynamic Entropy-Compressed Sequences and Full-Text Indexes

DOI10.1007/11780441_28zbMath1196.68064OpenAlexW1885799453MaRDI QIDQ5307515

Veli Mäkinen, Gonzalo Navarro

Publication date: 14 September 2007

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

Full work available at URL: https://doi.org/10.1007/11780441_28

Mathematics Subject Classification ID

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

Related Items (7)

Extended suffix array construction using Lyndon factors ⋮ Compressed Data Structures for Dynamic Sequences ⋮ Approximate all-pairs suffix/prefix overlaps ⋮ Rank and select revisited and extended ⋮ Optimal prefix and suffix queries on texts ⋮ Dynamic rank/select structures with applications to run-length encoded texts ⋮ Geometric BWT: compressed text indexing via sparse suffixes and range searching

This page was built for publication: Dynamic Entropy-Compressed Sequences and Full-Text Indexes