Document Open Access Logo

R-Enum Revisited: Speedup and Extension for Context-Sensitive Repeats and Net Frequencies

Authors Kotaro Kimura , Tomohiro I

PDF

File

Thumbnail PDF
PDF
LIPIcs.CPM.2026.10.pdf
  • Filesize: 0.84 MB
  • 14 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Pattern matching
Keywords
  • Supermaximal repeats
  • Largest maximal repeats
  • Net frequencies
  • Run-length Burrows-Wheeler transform
  • Compressed data mining

Metrics

Abstract

A repeat is a substring that occurs at least twice in a string, and is called a maximal repeat if it cannot be extended outwards without reducing its frequency. Nishimoto and Tabei [CPM, 2021] proposed r-enum, an algorithm to enumerate various characteristic substrings, including maximal repeats, in a string T of length n in O(r) words of compressed working space, where r ≤ n is the number of runs in the Burrows-Wheeler transform (BWT) of T. Given the run-length encoded BWT (RLBWT) of T, r-enum runs in O(n log log_w (n/r)) time in addition to the time linear to the number of output strings, where w = Θ(log n) is the word size. In this paper, we first improve the O(n log log_w (n/r)) term to O(n). We next extend r-enum to compute other context-sensitive repeats such as near-supermaximal repeats (NSMRs) and supermaximal repeats, as well as the context diversity for every maximal repeat in the same complexities. Furthermore, we study net occurrences: An occurrence of a repeat is called a net occurrence if it is not covered by another repeat, and the net frequency of a repeat is the number of its net occurrences. With this terminology, an NSMR is a repeat with a positive net frequency. Given the RLBWT of T, we show how to compute the set 𝒮^{nsmr} of all NSMRs in T together with their net frequency/occurrences in O(n) time and O(r) space. We also show that an O(r)-space data structure can be built from the RLBWT to compute the net frequency/occurrences of any pattern in optimal time. The data structure is built in O(r) space and in O(n) time with high probability or deterministic O(n + |𝒮^{nsmr}| log log min(σ, |𝒮^{nsmr}|)) time, where σ ≤ r is the alphabet size of T. To achieve this, we prove that the total number of net occurrences is less than 2r. With the duality between net occurrences and minimal unique substrings (MUSs), we get a new upper bound 2r of the number of MUSs in T, which may be of independent interest.

Cite As Get BibTex

Kotaro Kimura and Tomohiro I. R-Enum Revisited: Speedup and Extension for Context-Sensitive Repeats and Net Frequencies. In 37th Annual Symposium on Combinatorial Pattern Matching (CPM 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 369, pp. 10:1-10:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.CPM.2026.10

Author Details

Kotaro Kimura
  • Kyushu Institute of Technology, Fukuoka, Japan
Tomohiro I
  • Kyushu Institute of Technology, Fukuoka, Japan

Funding

  • I, Tomohiro: KAKENHI 24K02899, JST AIP Acceleration Research JPMJCR24U4.

References

  1. Mohamed Ibrahim Abouelhoda, Stefan Kurtz, and Enno Ohlebusch. Replacing suffix trees with enhanced suffix arrays. Journal of Discrete Algorithms, 2(1):53-86, 2004. URL: https://doi.org/10.1016/S1570-8667(03)00065-0.
  2. Verónica Becher, Alejandro Deymonnaz, and Pablo Ariel Heiber. Efficient computation of all perfect repeats in genomic sequences of up to half a gigabyte, with a case study on the human genome. Bioinform., 25(14):1746-1753, 2009. URL: https://doi.org/10.1093/BIOINFORMATICS/BTP321.
  3. Djamal Belazzougui and Fabio Cunial. Space-efficient detection of unusual words. In Costas S. Iliopoulos, Simon J. Puglisi, and Emine Yilmaz, editors, Proc. 22nd International Symposium on String Processing and Information Retrieval (SPIRE) 2015, volume 9309 of Lecture Notes in Computer Science, pages 222-233. Springer, 2015. URL: https://doi.org/10.1007/978-3-319-23826-5_22.
  4. Djamal Belazzougui, Fabio Cunial, Juha Kärkkäinen, and Veli Mäkinen. Linear-time string indexing and analysis in small space. ACM Trans. Algorithms, 16(2):17:1-17:54, 2020. URL: https://doi.org/10.1145/3381417.
  5. Djamal Belazzougui and Gonzalo Navarro. Optimal lower and upper bounds for representing sequences. ACM Trans. Algorithms, 11(4):31:1-31:21, 2015. URL: https://doi.org/10.1145/2629339.
  6. Timo Beller, Katharina Berger, and Enno Ohlebusch. Space-efficient computation of maximal and supermaximal repeats in genome sequences. In Liliana Calderón-Benavides, Cristina N. González-Caro, Edgar Chávez, and Nivio Ziviani, editors, Proc. 19th International Symposium on String Processing and Information Retrieval (SPIRE) 2012, volume 7608 of Lecture Notes in Computer Science, pages 99-110. Springer, 2012. URL: https://doi.org/10.1007/978-3-642-34109-0_11.
  7. Anselm Blumer, J. Blumer, David Haussler, Ross M. McConnell, and Andrzej Ehrenfeucht. Complete inverted files for efficient text retrieval and analysis. J. ACM, 34(3):578-595, 1987. URL: https://doi.org/10.1145/28869.28873.
  8. Anselm Blumer, Janet Blumer, David Haussler, Andrzej Ehrenfeucht, M. T. Chen, and Joel Seiferas. The smallest automaton recognizing the subwords of a text. Theoretical Computer Science, 40:31-55, 1985. URL: https://doi.org/10.1016/0304-3975(85)90157-4.
  9. Michael Burrows and David J Wheeler. A block-sorting lossless data compression algorithm. Technical report, HP Labs, 1994. Google Scholar
  10. Francisco Claude, Gonzalo Navarro, and Alberto Ordóñez Pereira. The wavelet matrix: An efficient wavelet tree for large alphabets. Inf. Syst., 47:15-32, 2015. URL: https://doi.org/10.1016/J.IS.2014.06.002.
  11. Matthias Gallé. The bag-of-repeats representation of documents. In Gareth J. F. Jones, Paraic Sheridan, Diane Kelly, Maarten de Rijke, and Tetsuya Sakai, editors, Proc. 36th International ACM SIGIR conference on research and development in Information Retrieval 2013, pages 1053-1056. ACM, 2013. URL: https://doi.org/10.1145/2484028.2484142.
  12. Matthias Gallé and Matías Tealdi. On context-diverse repeats and their incremental computation. In Adrian-Horia Dediu, Carlos Martín-Vide, José Luis Sierra-Rodríguez, and Bianca Truthe, editors, Proc. 8th International Conference on Language and Automata Theory and Applications (LATA) 2014, volume 8370 of Lecture Notes in Computer Science, pages 384-395. Springer, 2014. URL: https://doi.org/10.1007/978-3-319-04921-2_31.
  13. Matthias Gallé and Matías Tealdi. xkcd-repeats: A new taxonomy of repeats defined by their context diversity. J. Discrete Algorithms, 48:1-16, 2018. URL: https://doi.org/10.1016/J.JDA.2017.10.005.
  14. Peaker Guo, Patrick Eades, Anthony Wirth, and Justin Zobel. Exploiting new properties of string net frequency for efficient computation. In Shunsuke Inenaga and Simon J. Puglisi, editors, Proc. 35th Annual Symposium on Combinatorial Pattern Matching (CPM) 2024, volume 296 of LIPIcs, pages 16:1-16:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. URL: https://doi.org/10.4230/LIPIcs.CPM.2024.16.
  15. Peaker Guo and Kaisei Kishi. Net occurrences in fibonacci and thue-morse words. In Paola Bonizzoni and Veli Mäkinen, editors, Proc. 36th Annual Symposium on Combinatorial Pattern Matching (CPM) 2025, volume 331 of LIPIcs, pages 16:1-16:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. URL: https://doi.org/10.4230/LIPIcs.CPM.2025.16.
  16. Peaker Guo, Seeun William Umboh, Anthony Wirth, and Justin Zobel. Online computation of string net frequency. In Zsuzsanna Lipták, Edleno Silva de Moura, Karina Figueroa, and Ricardo Baeza-Yates, editors, Proc. 31st International Symposium on String Processing and Information Retrieval (SPIRE) 2024, volume 14899 of Lecture Notes in Computer Science, pages 159-173. Springer, 2024. URL: https://doi.org/10.1007/978-3-031-72200-4_12.
  17. Dan Gusfield. Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology. Cambridge University Press, 1997. URL: https://doi.org/10.1017/CBO9780511574931.
  18. Lucian Ilie and William F. Smyth. Minimum unique substrings and maximum repeats. Fundam. Informaticae, 110(1-4):183-195, 2011. URL: https://doi.org/10.3233/FI-2011-536.
  19. Shunsuke Inenaga. Faster and simpler online computation of string net frequency, 2024. arXiv:2410.06837. URL: https://doi.org/10.48550/arXiv.2410.06837.
  20. Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, and Giulio Pavesi. On-line construction of compact directed acyclic word graphs. Discrete Applied Mathematics, 146(2):156-179, 2005. URL: https://doi.org/10.1016/J.DAM.2004.04.012.
  21. Yih-Jeng Lin and Ming-Shing Yu. Extracting chinese frequent strings without dictionary from a chinese corpus, its applications. J. Inf. Sci. Eng., 17(5):805-824, 2001. URL: http://www.iis.sinica.edu.tw/page/jise/2001/200109_07.html.
  22. Yih-Jeng Lin and Ming-Shing Yu. The properties and further applications of chinese frequent strings. Int. J. Comput. Linguistics Chin. Lang. Process., 9(1), 2004. URL: http://www.aclclp.org.tw/clclp/v9n1/v9n1a7.pdf.
  23. Udi Manber and Eugene W. Myers. Suffix arrays: A new method for on-line string searches. SIAM J. Comput., 22(5):935-948, 1993. URL: https://doi.org/10.1137/0222058.
  24. Tomonari Masada, Atsuhiro Takasu, Yuichiro Shibata, and Kiyoshi Oguri. Clustering documents with maximal substrings. In Proc. 13th International Conference on Enterprise Information Systems ICEIS 2011, pages 19-34, 2011. URL: https://doi.org/10.1007/978-3-642-29958-2_2.
  25. Takuya Mieno and Shunsuke Inenaga. Space-efficient online computation of string net occurrences. In Paola Bonizzoni and Veli Mäkinen, editors, Proc. 36th Annual Symposium on Combinatorial Pattern Matching (CPM) 2025, volume 331 of LIPIcs, pages 23:1-23:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. URL: https://doi.org/10.4230/LIPIcs.CPM.2025.23.
  26. S. Muthukrishnan. Efficient algorithms for document retrieval problems. In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) 2002, pages 657-666, 2002. URL: http://dl.acm.org/citation.cfm?id=545381.545469.
  27. Jacques Nicolas, Christine Rousseau, Anne Siegel, Pierre Peterlongo, François Coste, Patrick Durand, Sébastien Tempel, Anne-Sophie Valin, and Frédéric Mahé. Modeling local repeats on genomic sequences. Research Report RR-6802, INRIA, 2008. URL: https://inria.hal.science/inria-00353690.
  28. Takaaki Nishimoto and Yasuo Tabei. Optimal-time queries on BWT-runs compressed indexes. In Nikhil Bansal, Emanuela Merelli, and James Worrell, editors, Proc. 48th International Colloquium on Automata, Languages and Programming (ICALP) 2021, volume 198 of LIPIcs, pages 101:1-101:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. URL: https://doi.org/10.4230/LIPIcs.ICALP.2021.101.
  29. Takaaki Nishimoto and Yasuo Tabei. Optimal-time queries on BWT-runs compressed indexes, 2021. arXiv:2006.05104v3. Google Scholar
  30. Takaaki Nishimoto and Yasuo Tabei. R-enum: Enumeration of characteristic substrings in BWT-runs bounded space. In Pawel Gawrychowski and Tatiana Starikovskaya, editors, Proc. 32nd Annual Symposium on Combinatorial Pattern Matching (CPM) 2021, volume 191 of LIPIcs, pages 21:1-21:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. URL: https://doi.org/10.4230/LIPIcs.CPM.2021.21.
  31. Enno Ohlebusch and Timo Beller. Alphabet-independent algorithms for finding context-sensitive repeats in linear time. J. Discrete Algorithms, 34:23-36, 2015. URL: https://doi.org/10.1016/J.JDA.2015.05.005.
  32. Enno Ohlebusch, Thomas Büchler, and Jannik Olbrich. Faster computation of chinese frequent strings and their net frequencies. In Zsuzsanna Lipták, Edleno Silva de Moura, Karina Figueroa, and Ricardo Baeza-Yates, editors, Proc. 31st International Symposium on String Processing and Information Retrieval (SPIRE) 2024, volume 14899 of Lecture Notes in Computer Science, pages 249-256. Springer, 2024. URL: https://doi.org/10.1007/978-3-031-72200-4_19.
  33. Daisuke Okanohara and Jun'ichi Tsujii. Text categorization with all substring features. In Proc. SIAM International Conference on Data Mining (SDM) 2009, pages 838-846, 2009. URL: https://doi.org/10.1137/1.9781611972795.72.
  34. Milan Ruzic. Constructing efficient dictionaries in close to sorting time. In Proc. 35th International Colloquium on Automata, Languages and Programming (ICALP) 2008, pages 84-95, 2008. URL: https://doi.org/10.1007/978-3-540-70575-8_8.
  35. Peter Weiner. Linear pattern-matching algorithms. In Proc. 14th IEEE Ann. Symp. on Switching and Automata Theory, pages 1-11, 1973. URL: https://doi.org/10.1109/SWAT.1973.13.
  36. Dan E. Willard. Examining computational geometry, van emde boas trees, and hashing from the perspective of the fusion tree. SIAM J. Comput., 29(3):1030-1049, 2000. URL: https://doi.org/10.1137/S0097539797322425.
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-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact