Counting Colours in Compressed Strings

DOI10.1007/978-3-642-21458-5_18zbMath1339.68331arXiv1011.3480OpenAlexW1565681997MaRDI QIDQ3011854

Travis Gagie, Juha Kärkkäinen

Publication date: 29 June 2011

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

Full work available at URL: https://arxiv.org/abs/1011.3480

Mathematics Subject Classification ID

Data structures (68P05) Algorithms on strings (68W32)

Related Items (6)

Dynamic range majority data structures ⋮ Colored range queries and document retrieval ⋮ Wavelet trees for all ⋮ Array Range Queries ⋮ Data structures for categorical path counting queries ⋮ Succinct Color Searching in One Dimension

Uses Software

• PATRICIA

Cites Work

• Unnamed Item
• Unnamed Item
• Rank/select on dynamic compressed sequences and applications
• Succinct data structures for flexible text retrieval systems
• Approximate colored range and point enclosure queries
• Rank and select revisited and extended
• Compressed representations of sequences and full-text indexes
• Efficient Colored Orthogonal Range Counting
• Combinatorial Pattern Matching

This page was built for publication: Counting Colours in Compressed Strings