Counting on General Run-Length Grammars
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916587328503808 |
|---|---|
| author | Navarro, Gonzalo Pacheco, Alejandro |
| author_facet | Navarro, Gonzalo Pacheco, Alejandro |
| contents | We introduce a data structure for counting pattern occurrences in texts compressed with any run-length context-free grammar. Our structure uses space proportional to the grammar size and counts the occurrences of a pattern of length $m$ in a text of length $n$ in time \(O(m\log^{2+ε} n)\), for any constant \(ε> 0\) chosen at indexing time. This is the first solution to an open problem posed by Christiansen et al.~[ACM TALG 2020] and enhances our abilities for computation over compressed data; we give an example application. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_00221 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Counting on General Run-Length Grammars Navarro, Gonzalo Pacheco, Alejandro Data Structures and Algorithms We introduce a data structure for counting pattern occurrences in texts compressed with any run-length context-free grammar. Our structure uses space proportional to the grammar size and counts the occurrences of a pattern of length $m$ in a text of length $n$ in time \(O(m\log^{2+ε} n)\), for any constant \(ε> 0\) chosen at indexing time. This is the first solution to an open problem posed by Christiansen et al.~[ACM TALG 2020] and enhances our abilities for computation over compressed data; we give an example application. |
| title | Counting on General Run-Length Grammars |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2406.00221 |