Document Open Access Logo

Counting on General Run-Length Grammars

Authors Gonzalo Navarro , Alejandro Pacheco

PDF HTML 5

Files

Thumbnail PDF
PDF
LIPIcs.CPM.2025.3.pdf
  • Filesize: 1.09 MB
  • 17 pages
HTML5 Logo HTML (experimental)
LIPIcs.CPM.2025.3.html

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Data structures design and analysis
Keywords
  • Grammar-based indexing
  • Run-length context-free grammars
  • Counting pattern occurrences
  • Periods in strings

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

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(mlog^{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.

Cite As Get BibTex

Gonzalo Navarro and Alejandro Pacheco. Counting on General Run-Length Grammars. In 36th Annual Symposium on Combinatorial Pattern Matching (CPM 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 331, pp. 3:1-3:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.CPM.2025.3

Author Details

Gonzalo Navarro
  • Center for Biotechnology and Bioengineering (CeBiB), Department of Computer Science, University of Chile, Santiago, Chile
Alejandro Pacheco
  • Center for Biotechnology and Bioengineering (CeBiB), Department of Computer Science, University of Chile, Santiago, Chile

Funding

  • Navarro, Gonzalo: Funded by Basal Funds FB0001 and AFB240001, Mideplan, Chile, and Fondecyt Grant 1-230755, Chile.
  • Pacheco, Alejandro: Funded by Basal Funds FB0001 and AFB240001, Mideplan, Chile, Fondecyt Grant 1-230755, Chile, and ANID/Scholarship Program/DOCTORADO BECAS CHILE/2018-21180760.

Acknowledgements

We thank the reviewers for their comments, particularly one that did an exhaustive and thoughtful job to improve our presentation.

References

  1. Djamal Belazzougui, Fabiano C Botelho, and Martin Dietzfelbinger. Hash, displace, and compress. In Proc. European Symposium on Algorithms (ESA), pages 682-693. Springer, 2009. URL: https://doi.org/10.1007/978-3-642-04128-0_61.
  2. P. Bille, M. B. Ettienne, I. L. Gørtz, and H. W. Vildhøj. Time-space trade-offs for Lempel-Ziv compressed indexing. Theoretical Computer Science, 713:66-77, 2018. URL: https://doi.org/10.1016/J.TCS.2017.12.021.
  3. P. Bille, G. M. Landau, R. Raman, K. Sadakane, S. S. Rao, and O. Weimann. Random access to grammar-compressed strings and trees. SIAM Journal on Computing, 44(3):513-539, 2015. URL: https://doi.org/10.1137/130936889.
  4. Philip Bille, Inge Li Gørtz, Benjamin Sach, and Hjalte Wedel Vildhøj. Time-space trade-offs for longest common extensions. Journal of Discrete Algorithms, 25:42-50, 2014. URL: https://doi.org/10.1016/J.JDA.2013.06.003.
  5. M. Charikar, E. Lehman, D. Liu, R. Panigrahy, M. Prabhakaran, A. Sahai, and A. Shelat. The smallest grammar problem. IEEE Transactions on Information Theory, 51(7):2554-2576, 2005. URL: https://doi.org/10.1109/TIT.2005.850116.
  6. B. Chazelle. A functional approach to data structures and its use in multidimensional searching. SIAM Journal on Computing, 17(3):427-462, 1988. URL: https://doi.org/10.1137/0217026.
  7. Anders Roy Christiansen, Mikko Berggren Ettienne, Tomasz Kociumaka, Gonzalo Navarro, and Nicola Prezza. Optimal-time dictionary-compressed indexes. ACM Transactions on Algorithms (TALG), 17(1):1-39, 2020. URL: https://doi.org/10.1145/3426473.
  8. F. Claude and G. Navarro. Self-indexed grammar-based compression. Fundamenta Informaticae, 111(3):313-337, 2010. URL: https://doi.org/10.3233/FI-2011-565.
  9. F. Claude and G. Navarro. Improved grammar-based compressed indexes. In Proc. 19th International Symposium on String Processing and Information Retrieval (SPIRE), pages 180-192, 2012. Google Scholar
  10. Francisco Claude, Gonzalo Navarro, and Alejandro Pacheco. Grammar-compressed indexes with logarithmic search time. Journal of Computer and System Sciences, 118:53-74, 2021. URL: https://doi.org/10.1016/J.JCSS.2020.12.001.
  11. Maxime Crochemore and Wojciech Rytter. Jewels of stringology: text algorithms. World Scientific, 2002. Google Scholar
  12. H. Ferrada, T. Gagie, T. Hirvola, and S. J. Puglisi. Hybrid indexes for repetitive datasets. Philosophical Transactions of the Royal Society A, 372(2016):article 20130137, 2014. Google Scholar
  13. H. Ferrada, D. Kempa, and S. J. Puglisi. Hybrid indexing revisited. In Proc. 20th Workshop on Algorithm Engineering and Experiments (ALENEX), pages 1-8, 2018. Google Scholar
  14. N. J. Fine and H. S. Wilf. Uniqueness theorems for periodic functions. Proceedings of the American Mathematical Society, 16(1):109-114, 1965. Google Scholar
  15. M. L. Fredman, J. Komlós, and E. Szemerédi. Storing a sparse table with O(1) worst case access time. Journal of the ACM, 31(3):538-544, 1984. URL: https://doi.org/10.1145/828.1884.
  16. T. Gagie, P. Gawrychowski, J. Kärkkäinen, Y. Nekrich, and S. J. Puglisi. A faster grammar-based self-index. In Proc. 6th International Conference on Language and Automata Theory and Applications (LATA), LNCS 7183, pages 240-251, 2012. Google Scholar
  17. T. Gagie, P Gawrychowski, J. Kärkkäinen, Y. Nekrich, and S. J. Puglisi. LZ77-based self-indexing with faster pattern matching. In Proc. 11th Latin American Symposium on Theoretical Informatics (LATIN), pages 731-742, 2014. Google Scholar
  18. T. Gagie, G. Navarro, and N. Prezza. Fully-functional suffix trees and optimal text searching in BWT-runs bounded space. Journal of the ACM, 67(1):article 2, 2020. Google Scholar
  19. Moses Ganardi, Artur Jez, and Markus Lohrey. Balancing straight-line programs. Journal of the ACM, 68(4):27:1-27:40, 2021. URL: https://doi.org/10.1145/3457389.
  20. Y. Gao. Computing matching statistics on repetitive texts. In Proc. 32nd Data Compression Conference (DCC), pages 73-82, 2022. Google Scholar
  21. Pawel Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Lacki, and Piotr Sankowski. Optimal dynamic strings. In Proc. 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1509-1528, 2018. URL: https://doi.org/10.1137/1.9781611975031.99.
  22. R. Grossi, A. Gupta, and J. S. Vitter. High-order entropy-compressed text indexes. In Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 841-850, 2003. Google Scholar
  23. A. Jez. Approximation of grammar-based compression via recompression. Theoretical Computer Science, 592:115-134, 2015. URL: https://doi.org/10.1016/J.TCS.2015.05.027.
  24. A. Jez. A really simple approximation of smallest grammar. Theoretical Computer Science, 616:141-150, 2016. URL: https://doi.org/10.1016/J.TCS.2015.12.032.
  25. Juha Kärkkäinen and Esko Ukkonen. Lempel-Ziv parsing and sublinear-size index structures for string matching. In Proc. 3rd South American Workshop on String Processing (WSP), pages 141-155, 1996. Google Scholar
  26. R. M. Karp and M. O. Rabin. Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development, 2:249-260, 1987. Google Scholar
  27. D. Kempa and N. Prezza. At the roots of dictionary compression: String attractors. In Proc. 50th Annual ACM Symposium on the Theory of Computing (STOC), pages 827-840, 2018. Google Scholar
  28. Dominik Kempa and Tomasz Kociumaka. Collapsing the hierarchy of compressed data structures: Suffix arrays in optimal compressed space. In Proc. 64th IEEE Annual Symposium on Foundations of Computer Science (FOCS), pages 1877-1886, 2023. URL: https://doi.org/10.1109/FOCS57990.2023.00114.
  29. J. C. Kieffer and E.-H. Yang. Grammar-based codes: A new class of universal lossless source codes. IEEE Transactions on Information Theory, 46(3):737-754, 2000. URL: https://doi.org/10.1109/18.841160.
  30. Tomasz Kociumaka, Gonzalo Navarro, and Francisco Olivares. Near-optimal search time in δ-optimal space, and vice versa. Algorithmica, 86(4):1031-1056, 2024. URL: https://doi.org/10.1007/S00453-023-01186-0.
  31. Tomasz Kociumaka, Gonzalo Navarro, and Nicola Prezza. Toward a definitive compressibility measure for repetitive sequences. IEEE Transactions on Information Theory, 69(4):2074-2092, 2023. URL: https://doi.org/10.1109/TIT.2022.3224382.
  32. Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, and Tomasz Walen. Internal pattern matching queries in a text and applications. In Proc. 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 532-551, 2015. URL: https://doi.org/10.1137/1.9781611973730.36.
  33. S. Kreft and G. Navarro. On compressing and indexing repetitive sequences. Theoretical Computer Science, 483:115-133, 2013. URL: https://doi.org/10.1016/J.TCS.2012.02.006.
  34. J. Larsson and A. Moffat. Off-line dictionary-based compression. Proceedings of the IEEE, 88(11):1722-1732, 2000. URL: https://doi.org/10.1109/5.892708.
  35. A. Lempel and J. Ziv. On the complexity of finite sequences. IEEE Transactions on Information Theory, 22(1):75-81, 1976. URL: https://doi.org/10.1109/TIT.1976.1055501.
  36. S. Maruyama, H. Sakamoto, and M. Takeda. An online algorithm for lightweight grammar-based compression. Algorithms, 5(2):214-235, 2012. URL: https://doi.org/10.3390/A5020214.
  37. G. Navarro. Spaces, trees and colors: The algorithmic landscape of document retrieval on sequences. ACM Computing Surveys, 46(4):article 52, 2014. 47 pages. Google Scholar
  38. G. Navarro. Wavelet trees for all. Journal of Discrete Algorithms, 25:2-20, 2014. URL: https://doi.org/10.1016/J.JDA.2013.07.004.
  39. G. Navarro. Indexing highly repetitive string collections, part I: Repetitiveness measures. ACM Computing Surveys, 54(2):article 29, 2021. Google Scholar
  40. G. Navarro. Indexing highly repetitive string collections, part II: Compressed indexes. ACM Computing Surveys, 54(2):article 26, 2021. Google Scholar
  41. G. Navarro. Computing MEMs on repetitive text collections. In Proc. 34th Annual Symposium on Combinatorial Pattern Matching (CPM), page article 22, 2023. Google Scholar
  42. G. Navarro, F. Olivares, and C. Urbina. Balancing run-length straight-line programs. In Proc. 29th International Symposium on String Processing and Information Retrieval (SPIRE), pages 117-131, 2022. Google Scholar
  43. G. Navarro and N. Prezza. Universal compressed text indexing. Theoretical Computer Science, 762:41-50, 2019. URL: https://doi.org/10.1016/J.TCS.2018.09.007.
  44. Gonzalo Navarro. Document listing on repetitive collections with guaranteed performance. Theoretical Computer Science, 772:58-72, 2019. URL: https://doi.org/10.1016/J.TCS.2018.11.022.
  45. Gonzalo Navarro. Computing MEMs and relatives on repetitive text collections. ACM Transactions on Algorithms, 21(1):article 12, 2025. Google Scholar
  46. C. Nevill-Manning, I. Witten, and D. Maulsby. Compression by induction of hierarchical grammars. In Proc. 4th Data Compression Conference (DCC), pages 244-253, 1994. Google Scholar
  47. T. Nishimoto, T. I, S. Inenaga, H. Bannai, and M. Takeda. Fully dynamic data structure for LCE queries in compressed space. In Proc. 41st International Symposium on Mathematical Foundations of Computer Science (MFCS), pages 72:1-72:15, 2016. Google Scholar
  48. Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, and Adam Smith. Sublinear algorithms for approximating string compressibility. Algorithmica, 65:685-709, 2013. URL: https://doi.org/10.1007/S00453-012-9618-6.
  49. W. Rytter. Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theoretical Computer Science, 302(1-3):211-222, 2003. URL: https://doi.org/10.1016/S0304-3975(02)00777-6.
  50. H. Sakamoto. A fully linear-time approximation algorithm for grammar-based compression. Journal of Discrete Algorithms, 3(2–4):416-430, 2005. URL: https://doi.org/10.1016/J.JDA.2004.08.016.
  51. J. A. Storer and T. G. Szymanski. Data compression via textual substitution. Journal of the ACM, 29(4):928-951, 1982. URL: https://doi.org/10.1145/322344.322346.
  52. K. Tsuruta, D. Köppl, Y. Nakashima, S. Inenaga, H. Bannai, and M. Takeda. Grammar-compressed self-index with Lyndon words. CoRR, 2004.05309, 2020. URL: https://arxiv.org/abs/2004.05309.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact