Improved bounds on the average length of longest common subsequences

It has long been known Chvtal and Sankoff 1975 that the average length of the longest common subsequence of two random strings of length n over an alphabet of size k is asymptotic to kn for some co...