A picture of common subsequence length for two random strings over an alphabet of 4 symbols
S. V. Znamenskij

Список литературы
1.	R. Durbin, S. Eddy, A. Krogh, G. Mitchison, Biological sequence analysis: probabilistic models of proteins and nucleic acids, Cambridge University Press, 1998, 370 pp.
2.	J.  G. Reich, H. Drabsch, A. Däumler, “On the statistical assessment of similarities in DNA sequences”, Nucleic acids research, 12:13 (1984), 5529–5543
3.	K. Ning, K. P. Choi, Systematic assessment of the expected length, variance and distribution of Longest Common Subsequences, 2013, arXiv: 1306.4253
4.	V. Chvátal, D. Sankoff, “Longest Common subsequences of two random sequences”, J. Appl. Probability, 12:2 (1975), 306–315
5.	R. Bundschuh, “High precision simulations of the longest common subsequence problem”, The European Physical Journal B-Condensed Matter and Complex Systems, 22:4 (2001), 533–541