Document Open Access Logo

Smallest Suffixient Set Maintenance in Near-Real-Time

Authors Dominik Köppl , Gregory Kucherov

PDF

File

Thumbnail PDF
PDF
LIPIcs.MFCS.2026.86.pdf
  • Filesize: 1.07 MB
  • 18 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Information systems → Information retrieval
Keywords
  • online algorithms
  • string algorithms
  • suffix tree
  • real-time computation
  • smallest suffixient set
  • string attractor

Metrics

Abstract

The size of the smallest suffixient set of positions of a string recently emerged as a new measure of string repetitiveness - a measure reflecting how much of repetitive content the string contains. We study how to maintain the smallest suffixient set online in near-real-time, that is with small (in our case, polyloglog) worst-case time for processing each letter. Two frameworks are considered: when the text is given letter-by-letter in either right-to-left or left-to-right order. Our central algorithmic tool is Weiner’s suffix tree algorithm and associated algorithmic primitives for its efficient implementation.

Cite As Get BibTex

Dominik Köppl and Gregory Kucherov. Smallest Suffixient Set Maintenance in Near-Real-Time. In 51st International Symposium on Mathematical Foundations of Computer Science (MFCS 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 386, pp. 86:1-86:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.MFCS.2026.86

Author Details

Dominik Köppl
  • University of Yamanashi, Kofu, Japan
Gregory Kucherov
  • LIGM, CNRS and Gustave Eiffel University, Marne-la-Vallée, France

Funding

  • Köppl, Dominik: This work was supported in part by JSPS KAKENHI Grant Number 25K21150. We thank Fédération de Recherche Bézout for supporting the research visit of the first author to LIGM, where this work was initiated.

References

  1. Dany Breslauer and Giuseppe F. Italiano. Near real-time suffix tree construction via the fringe marked ancestor problem. J. Discrete Algorithms, 18:32-48, 2013. URL: https://doi.org/10.1016/j.jda.2012.07.003.
  2. Andrej Brodnik, Svante Carlsson, Erik D. Demaine, J. Ian Munro, and Robert Sedgewick. Resizable arrays in optimal time and space. In Proc. WADS, volume 1663 of LNCS, pages 37-48, 1999. URL: https://doi.org/10.1007/3-540-48447-7_4.
  3. Davide Cenzato, Lore Depuydt, Travis Gagie, Sung-Hwan Kim, Giovanni Manzini, Francisco Olivares, and Nicola Prezza. Suffixient arrays: a new efficient suffix array compression technique. CoRR, abs/2407.18753, 2025. URL: https://doi.org/10.48550/arXiv.2407.18753.
  4. Davide Cenzato, Francisco Olivares, and Nicola Prezza. On computing the smallest suffixient set. In Zsuzsanna Lipták, Edleno Silva de Moura, Karina Figueroa, and Ricardo Baeza-Yates, editors, String Processing and Information Retrieval - 31st International Symposium, SPIRE 2024, Puerto Vallarta, Mexico, September 23-25, 2024, Proceedings, volume 14899 of Lecture Notes in Computer Science, pages 73-87. Springer, 2024. URL: https://doi.org/10.1007/978-3-031-72200-4_6.
  5. Davide Cenzato, Francisco Olivares, and Nicola Prezza. Testing suffixient sets. CoRR, abs/2506.08225, 2025. URL: https://doi.org/10.48550/arXiv.2506.08225.
  6. Anders Roy Christiansen, Mikko Berggren Ettienne, Tomasz Kociumaka, Gonzalo Navarro, and Nicola Prezza. Optimal-time dictionary-compressed indexes. ACM Trans. Algorithms, 17(1), December 2021. URL: https://doi.org/10.1145/3426473.
  7. Richard Cole and Ramesh Hariharan. Dynamic LCA queries on trees. SIAM J. Comput., 34(4):894-923, 2005. URL: https://doi.org/10.1137/S0097539700370539.
  8. Lore Depuydt, Travis Gagie, Ben Langmead, Giovanni Manzini, and Nicola Prezza. Suffixient sets. CoRR, abs/2312.01359, 2023. URL: https://doi.org/10.48550/arXiv.2312.01359.
  9. Johannes Fischer and Pawel Gawrychowski. Alphabet-dependent string searching with wexponential search trees. CoRR, abs/1302.3347, 2013. URL: https://arxiv.org/abs/1302.3347.
  10. Hiroto Fujimaru, Gonzalo Navarro, Giuseppe Romana, and Cristian Urbina. Smallest suffixient sets: Effectiveness, resilience, and calculation. CoRR, abs/2506.05638, 2025. URL: https://doi.org/10.48550/arXiv.2506.05638.
  11. Yoav Giyora and Haim Kaplan. Optimal dynamic vertical ray shooting in rectilinear planar subdivisions. ACM Trans. Algorithms, 5(3):28:1-28:51, 2009. URL: https://doi.org/10.1145/1541885.1541889.
  12. Dan Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, 1997. URL: https://doi.org/10.1017/CBO9780511574931.
  13. Dominik Kempa and Nicola Prezza. At the roots of dictionary compression: string attractors. In Proc. STOC, pages 827-840, 2018. URL: https://doi.org/10.1145/3188745.3188814.
  14. Dominik Köppl and Gregory Kucherov. Near-real-time solutions for online string problems. CoRR, abs/2602.15311, 2026. to appear in CPM 2026. URL: https://doi.org/10.48550/arXiv.2602.15311.
  15. Gregory Kucherov and Yakov Nekrich. Full-fledged real-time indexing for constant size alphabets. Algorithmica, 79(2):387-400, 2017. URL: https://doi.org/10.1007/s00453-016-0199-7.
  16. Gregory Kucherov and Yakov Nekrich. Online computation of normalized substring complexity. CoRR, abs/2510.16454, 2025. appeared in LATIN 2026. URL: https://doi.org/10.48550/arXiv.2510.16454.
  17. Christian Worm Mortensen. Fully-dynamic two dimensional orthogonal range and line segment intersection reporting in logarithmic time. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 12-14, 2003, Baltimore, Maryland, USA, pages 618-627. ACM/SIAM, 2003. URL: http://dl.acm.org/citation.cfm?id=644108.644210.
  18. Christian Worm Mortensen. Fully dynamic orthogonal range reporting on RAM. SIAM J. Comput., 35(6):1494-1525, 2006. URL: https://doi.org/10.1137/S0097539703436722.
  19. Gonzalo Navarro. Indexing highly repetitive string collections, part I: repetitiveness measures. ACM Comput. Surv., 54(2):29:1-29:31, 2021. URL: https://doi.org/10.1145/3434399.
  20. Gonzalo Navarro. Indexing highly repetitive string collections, part II: compressed indexes. ACM Comput. Surv., 54(2):26:1-26:32, 2021. URL: https://doi.org/10.1145/3432999.
  21. Gonzalo Navarro, Giuseppe Romana, and Cristian Urbina. Smallest suffixient sets as a repetitiveness measure. In Golnaz Badkobeh, Jakub Radoszewski, Nicola Tonellotto, and Ricardo Baeza-Yates, editors, String Processing and Information Retrieval - 32nd International Symposium, SPIRE 2025, London, UK, September 8-11, 2025, Proceedings, volume 16073 of Lecture Notes in Computer Science, pages 217-232. Springer, 2025. URL: https://doi.org/10.1007/978-3-032-05228-5_18.
  22. Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, and Adam D. Smith. Sublinear algorithms for approximating string compressibility. Algorithmica, 65(3):685-709, 2013. URL: https://doi.org/10.1007/s00453-012-9618-6.
  23. Hiroki Shibata and Hideo Bannai. String representation in suffixient set size space. CoRR, abs/2604.04377, 2026. URL: https://doi.org/10.48550/arXiv.2604.04377.
  24. Peter Weiner. Linear pattern matching algorithms. In Proc. 14th Symposium on Switching and Automata Theory (SWAT), pages 1-11, 1973. URL: https://doi.org/10.1109/SWAT.1973.13.
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