Jan 1, 2019 · We show that the number of all maximal α-gapped repeats and palindromes of a word of length n is at most 3 ( π 2 / 6 + 5 / 2 ) α n and 7 ( π ...

Feb 28, 2018 · Abstract:We show that the number of all maximal \alpha-gapped repeats and palindromes of a word of length n is at most 3(\pi^2/6 + 5/2) ...

Given a word w, a gapped repeat is a triple of integers (iλ,iρ,u) with the properties (a) 0 < iρ − iλ, and. (b) w[iλ..iλ + u − 1] = w[iρ..iρ + u − 1].

Abstract. We show that the number of all maximal $\alpha$-gapped repeats and palindromes of a word of length $n$ is at most $3(\pi^2/6 + 5/2) \alpha n$ and ...

Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes · Mathematics. Theory of Computing Systems · 2017.

Dec 12, 2024 · Tighter bounds and optimal algorithms for all maximal α-gapped repeats and palindromes. Theory of Computing Systems, 62(1):162-191, 2018.

Improved Upper Bounds on all Maximal α-gapped Repeats and Palindromes · T. I., Dominik Köppl · Published in Theoretical Computer Science 28 February 2018 ...

Nov 30, 2018 · Tomohiro I, Dominik Köppl: Improved upper bounds on all maximal α-gapped repeats and palindromes. Theor. Comput. Sci. 753: 1-15 (2019)

Improved upper bounds on all maximal α-gapped repeats and palindromes. https://doi.org/10.1016/j.tcs.2018.06.033 ·. Journal: Theoretical Computer Science ...

Our main result is the O ( α n ) bound on the number of maximal α-gapped repeats in a string of length n, previously proved to be O ( α 2 n ) in (Kolpakov et al ...