On the Variance of the Length of the Longest Common Subsequences in Random Words With an Omitted Letter

Abstract

We investigate the variance of the length of the longest common subsequences of two independent random words of size $n$, where the letters of one word are i.i.d. uniformly drawn from $\{{\alpha }_1,{\alpha }_2,\cdots ,{\alpha }_m\}$, while the letters of the other word are i.i.d. drawn from $\{{\alpha }_1,{\alpha }_2,\cdots ,{\alpha }_m,{\alpha }_{m+1}\}$, with probability $p>0$ to be ${\alpha }_{m+1}$, and $(1-p)/m>0$ for all the other letters. The order of the variance of this length is shown to be linear in $n$.

19 pages

References in corpus (2)

• Fluctuations of the Longest Common Subsequence in the Asymmetric Case of 2- and 3-Letter Alphabets
• Simulations, Computations, and Statistics for Longest Common Subsequences