Ümit Işlak, Alperen Y. Özdemir
Published 2018-03-11Version 1
The purpose of this paper is to study a statistic that is used to compare the similarity between two strings, which is first introduced by Michael Steele in 1982. It was proposed as an alternative to the length of the longest common subsequences, for which the variance problem is still open. Our results include moment asymptotics and distributional asymptotics for Steele's statistic and a variation of it in random words and random permutations.
A Note on the Expected Length of the Longest Common Subsequences of two i.i.d. Random Permutations
On the Variance of the Length of the Longest Common Subsequences in Random Words With an Omitted Letter
Simulations, Computations, and Statistics for Longest Common Subsequences
![QR code for arXiv:1803.04052 [math.PR]](http://oss.arxitics.com/images/favicon.svg)