Counting Colours in Compressed Strings
From MaRDI portal
Publication:3011854
DOI10.1007/978-3-642-21458-5_18zbMath1339.68331arXiv1011.3480MaRDI QIDQ3011854
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
Related Items
Succinct Color Searching in One Dimension, Dynamic range majority data structures, Colored range queries and document retrieval, Data structures for categorical path counting queries, Wavelet trees for all, Array Range Queries
Uses Software
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