Finding maximal closed substrings

DOI10.1016/J.TCS.2025.115628MaRDI QIDQ6884335zbMATH OpenFDO

Authors Golnaz Badkobeh, Alessandro De Luca, Gabriele Fici, Simon J. Puglisi

Publication date 15 December 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115628

zbMATH Keywords

closed stringcombinatorial algorithmscombinatorics on wordsgapped repeatmaximal repetition

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Cites work

• A classification of trapezoidal words
• A Fast Merging Algorithm
• Algorithms on Strings, Trees and Sequences
• scientific article; zbMATH DE number 2185638 (Why is no real title available?)
• Maximal closed substrings
• On the number of closed factors in a word
• Open and closed words
• Periodic-like words, periodicity, and boxes
• Searching of gapped repeats and subrepetitions in a word
• The ``runs theorem
• Tighter bounds and optimal algorithms for all maximal -gapped repeats and palindromes. Finding all maximal -gapped repeats and palindromes in optimal worst case time on integer alphabets

This page was built for publication: Finding maximal closed substrings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6884335)