Longest Gapped Repeats and Palindromes · arXivDesk
1511.07180Nov 23, 2015This is an extension of the conference papers "Longest $α$-Gapped Repeat and Palindrome", presented by the second and third authors at FCT 2015, and "Longest Gapped Repeats and Palindromes", presented by the first and third authors at MFCS 2015
A gapped repeat (respectively, palindrome) occurring in a word w is a factor uvu (respectively, uRvu) of w. In such a repeat (palindrome) u
Nearby in the stack
is called the arm of the repeat (respectively, palindrome), while
v
is called the gap. We show how to compute efficiently, for every position
i
of the word
w
, the longest gapped repeat and palindrome occurring at that position, provided that the length of the gap is subject to various types of restrictions. That is, that for each position