Improved Upper Bounds on all Maximal α-gapped Repeats and Palindromes
classification
💻 cs.FL
keywords
alphagappedmaximalpalindromesrepeatsboundsimprovedlength
read the original 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 $7 (\pi^2 / 6 + 1/2) \alpha n - 5 n - 1$, respectively.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.