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 E [L] /n converges to a constant γk. We prove a conjecture of Sankoff and Mainville from the early 80's claiming that γk √ k → 2 as k √ ∞. © Springer-Verlag 2004.
CITATION STYLE
Kiwi, M., Loebl, M., & Matoušek, J. (2004). Expected length of the longest common subsequence for large alphabets. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2976, 302–311. https://doi.org/10.1007/978-3-540-24698-5_34
Mendeley helps you to discover research relevant for your work.