Gapped Pattern Statistics

Abstract

We give a probabilistic analysis of parameters related to $\alpha$-gapped repeats and palindromes in random words, under both uniform and memoryless distributions (where letters have different probabilities, but are drawn independently). More precisely, we study the expected number of maximal $\alpha$-gapped patterns, as well as the expected length of the longest $\alpha$-gapped pattern in a random word.