Maximal closed substrings

DOI10.1007/978-3-031-20643-6_2zbMath1525.68201arXiv2209.00271OpenAlexW4312833556MaRDI QIDQ6166967

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

Publication date: 4 August 2023

Published in: String Processing and Information Retrieval (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2209.00271

zbMATH Keywords

runclosed wordmaximal closed substring

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• Unnamed Item
• Searching of gapped repeats and subrepetitions in a word
• Tighter bounds and optimal algorithms for all maximal \(\alpha\)-gapped repeats and palindromes. Finding all maximal \(\alpha\)-gapped repeats and palindromes in optimal worst case time on integer alphabets
• Enumeration and structure of trapezoidal words
• The sequence of open and closed prefixes of a Sturmian word
• On the Number of Closed Factors in a Word
• A Fast Merging Algorithm
• Uniqueness Theorems for Periodic Functions
• The “Runs” Theorem
• Periodic-like words, periodicity, and boxes

This page was built for publication: Maximal closed substrings