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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 1060; S. 115628
Hauptverfasser:	Badkobeh, Golnaz, De Luca, Alessandro, Fici, Gabriele, Puglisi, Simon J.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 18.01.2026
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!