Expected length of the longest common subsequence for large alphabets

Advances in Mathematics

Volumn 197, Issue 2, 2005, Pages 480-498

  Kiwi, Marcos ^a   Loebl, Martin ^b   Matoušek, Jiří ^b  

^a UNIVERSITY OF CHILE   (Chile)

^b CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Expectation; Longest common subsequence; Longest increasing subsequence; Sankoff Mainville conjecture

Indexed keywords

EID: 27244432573     PISSN: 00018708     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.aim.2004.10.012     Document Type: Article

References (24)

1. D. Aldous P. Diaconis Longest increasing subsequences: From patience sorting to the Baik-Deift-Johansson theorem Bull. Amer. Math. Soc. 36 4 1999 413-432
2. R. Baer, P. Brock, Natural sorting over permutation spaces, Math. Comput. (1967) 385-410.
3. R. Baeza-Yates G. Navarro R. Gavaldá R. Schehing Bounding the expected length of the longest common subsequences and forests Theory Comput. Systems 32 4 1999 435-452
4. J. Baik P. Deift K. Johansson On the distribution of the length of the longest increasing subsequence of random permutations J. Amer. Math. Soc. 12 1999 1119-1178
5. V. Chvátal D. Sankoff Longest common subsequences of two random sequences J. Appl. Probab. 12 1975 306-315
6. V. Dančík, Expected length of longest common subsequences, Ph.D. Thesis, Department of Computer Science, University of Warwick, September 1994.
7. P. Erdos G. Szekeres A combinatorial problem in geometry Compositio Math. 2 1935 463-470
8. A. Frieze On the length of the longest monotone subsequence in a random permutation Ann. Appl. Probab. 1 2 1991 301-305
9. J. Gravner C. Tracy H. Widom Limit theorems for height fluctuations in a class of discrete space time growth models J. Statist. Phys. 102 2001 1085-1132
10. J.M. Hammersley A few seedlings of research in: Proceedings of the Sixth Berkeley Symposium on Mathematical and Statistical Probability Berkeley, CA 1972 University of California Press CA 345-394
11. S. Janson T. Łuczak A. Rucinski Random Graphs 2000 Wiley New York
12. J.F.C. Kingman Subadditive ergodic theory Ann. Probab. 1 6 1973 883-909
13. M. Kiwi M. Loebl Largest planar matching in random bipartite graphs Random Struct. Algorithms 21 2 2002 162-181
14. B. Logan L. Shepp A variational problem for random Young tableaux Adv. Math. 26 1977 206-222
15. G. Lueker Improved bounds on the average length of longest common subsequences Proceedings of the 14th Annual ACM/SIAM Symposium on Discrete Algorithms 2003 130-131
16. A. Okounkov, Random matrices and random permutations, International Mathematics Research Notices, 2000, 1043-1095.
17. P. Pevzner Computational Molecular Biology: An Algorithmic Approach 2000 MIT Press
18. D. Sankoff, J. Kruskal (Eds.), Common Subsequences and Monotone Subsequences, Addison-Wesley, Reading, MA, 1983, pp. 363-365. (Chapter 17).
19. C. Schensted Longest increasing and decreasing subsequences Canad. J. Math. 13 1961 179-191
20. T. Seppäläinen Increasing sequences of independent points on the planar lattice Ann. Appl. Probab. 7 1997 886-898
21. R. Stanley Recent progress in algebraic combinatorics Bull. Amer. Math. Soc. 40 1 2002 55-68
22. J.M. Steele An Efron-Stein inequality for nonsymmetric statistics Ann. Statist. 14 2 1986 753-758
23. S. Ulam Monte Carlo calculations in problems of mathematical physics in: Modern Mathematics for the Engineers 1961 McGraw-Hill New York 261-281
24. A. Vershik S. Kerov Asymptotics of the Plancherel measure of the symmetric group and the limiting form of Young tableaux Dokl. Akad. Nauk SSSR 233 1977 1024-1028