Maximal Closed Substrings

by   Golnaz Badkobeh, et al.

A string is closed if it has length 1 or has a nonempty border without internal occurrences. In this paper we introduce the definition 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 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 show that a string of length n contains 𝒪(n^1.5) MCSs. We also provide an output-sensitive algorithm that, given a string of length n over a constant-size alphabet, locates all m MCSs the string contains in 𝒪(nlog n + m) time.


page 1

page 2

page 3

page 4

∙ 08/08/2022

Almost optimal searching of maximal subrepetitions in a word

For 0<δ <1 a δ-subrepetition in a word is a factor which exponent is les...
∙ 05/30/2019

String-to-String Interpretations with Polynomial-Size Output

String-to-string MSO interpretations are like Courcelle's MSO transducti...
∙ 10/07/2019

Diamond Subgraphs in the Reduction Graph of a One-Rule String Rewriting System

In this paper, we study a certain case of a subgraph isomorphism problem...
∙ 06/01/2018

Block Palindromes: A New Generalization of Palindromes

We propose a new generalization of palindromes and gapped palindromes ca...
∙ 04/03/2020

Enumeration of LCP values, LCP intervals and Maximal repeats in BWT-runs Bounded Space

Lcp-values, lcp-intervals, and maximal repeats are powerful tools in var...
∙ 06/15/2018

Enhanced string factoring from alphabet orderings

In this note we consider the concept of alphabet ordering in the context...
∙ 10/05/2022

Computing maximal generalized palindromes

Palindromes are popular and important objects in textual data processing...

Please sign up or login with your details

Forgot password? Click here to reset