Expected length of the longest common subsequence for large alphabets

We consider the length L of the longest common subsequence of two randomly uniformly and independently chosen n character words over a k-ary alphabet. Subadditivity arguments yield that EL/n converges to a constant γk. We prove a conjecture of Sankoff and Mainville from the early 1980s claiming that γkk→2 as k→∞.