Finding maximal closed substrings

A string is closed if it has length 1 or has a nonempty border without internal occurrences. In this paper, we introduce the notion of a maximal closed substring (MCS), which is an occurrence of a closed substring that cannot be extended to the left nor to the right by one character into a longer cl...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Theoretical computer science Ročník 1060; s. 115628
Hlavní autoři: Badkobeh, Golnaz, De Luca, Alessandro, Fici, Gabriele, Puglisi, Simon J.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 18.01.2026
Témata:
Closed string
Combinatorial algorithms
Combinatorics on words
Gapped repeat
Maximal repetition
Closed string
Maximal repetition
Combinatorial algorithms
Combinatorics on words
Gapped repeat
ISSN:0304-3975
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:A string is closed if it has length 1 or has a nonempty border without internal occurrences. In this paper, we introduce the notion of a maximal closed substring (MCS), which is an occurrence of a closed substring that cannot be extended to the left nor to the right by one character into a longer closed substring. MCSs with exponent at least 2 are commonly called runs; those with exponent smaller than 2, instead, are particular cases of maximal gapped repeats. We provide an algorithm that, given a string of length n, locates all MCSs the string contains in O(nlogn) time.
ISSN:0304-3975
DOI:10.1016/j.tcs.2025.115628