Sep 30, 2015 · Such a repeat is called maximal if its arms cannot be extended simultaneously with the same symbol to the right or, respectively, to the left.

The number of all maximal α-gapped repeats in a word of length n is at most 18αn. We can compute the list of all α-gapped repeats in O(αn) time for integer ...

This allows us to construct an algorithm finding all the maximal $\alpha$-gapped repeats of a word in $O(\alpha n)$; this is optimal, in the worst case, as ...

This allows us to construct an algorithm finding all the maximal $\alpha$-gapped repeats of a word in $O(\alpha n)$; this is optimal, in the worst case, as ...

It is shown that the number of maximal α-gapped repeats that may occur in a word is upper bounded by 18αn, which allows an algorithm to be constructed that ...

It is shown that the number of maximal $\alpha$-gapped repeats that may occur in a word is upper bounded by $18\alpha n$, which allows us to construct an ...

efficiently finding all maximal α-gapped repeats. Pawe l Gawrychowski ... find {maximal α-gapped repeats of w}. ♢ find {maximal α-gapped palindromes of ...

Jan 1, 2019 · How to compute all maximal α-gapped repeats/palindromes efficiently, and: 2. What is the maximum number of maximal α-gapped repeats ...

Aug 24, 2017 · Since all maximal repetitions can be computed efficiently in O(n) time (see above), the problem of computing all α-gapped repeats in a word can.

We show that the number of all maximal alpha-gapped repeats occurring in words of length n is upper bounded by 18 * alpha * n, allowing us to construct an ...