Key points are not available for this paper at this time.
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^2+ n) ), for any constant (> 0). This closes 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.
Navarro et al. (Fri,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: