The Erdos-Renyi Strong Law for Pattern Matching with a Given Proportion of Mismatches

Consider two random sequences X₁ ⋯ Xₙ and Y₁ ⋯ Yₙ of i.i.d. letters in which the probability that two distinct letters match is $p > 0$. For each value a between p and 1, the length of the longest contiguous matching between the two sequences, requiring only a proportion a of corresponding letters to match, satisfies a strong law analogous to the Erdos-Renyi law for coin tossing. The same law applies to matching between two nonoverlapping regions within a single sequence X₁ ⋯ Xₙ, and a strong law with a smaller constant applies to matching between two overlapping regions within that single sequence. The method here also works to obtain the strong law for matching between multidimensional arrays, between two Markov chains and for the situation in which a given proportion of mismatches is required.