On a Speculated Relation Between Chvátal–Sankoff Constants of Several Sequences

It is well known that, when normalized by n, the expected length of a longest common subsequence of d sequences of length n over an alphabet of size σ converges to a constant γσ,d. We disprove a speculation by Steele regarding a possible relation between γ2,d and γ2,2. In order to do that we also obtain some new lower bounds for γσ,d, when both σ and d are small integers.

[1]  Vlado Dancík,et al.  Common Subsequences and Supersequences and their Expected Length , 1995, Combinatorics, Probability and Computing.

[2]  Mike Paterson,et al.  Upper Bounds for the Expected Length of a Longest Common Subsequence of Two Binary Sequences , 1995, Random Struct. Algorithms.

[3]  George S. Lueker,et al.  Improved bounds on the average length of longest common subsequences , 2003, JACM.

[4]  Michael S. Waterman,et al.  Introduction to computational biology , 1995 .

[5]  Jirí Matousek,et al.  Expected Length of the Longest Common Subsequence for Large Alphabets , 2003, LATIN.

[6]  B. Bollobás,et al.  The longest chain among random points in Euclidean space , 1988 .

[7]  J. Steele.  Probability theory and combinatorial optimization , 1987 .

[8]  Kenneth S. Alexander,et al.  The Rate of Convergence of the Mean Length of the Longest Common Subsequence , 1994 .

[9]  J. Steele.  An Efron-Stein inequality for nonsymmetric statistics , 1986 .

[10]  Wojciech Szpankowski,et al.  Average Case Analysis of Algorithms on Sequences: Szpankowski/Average , 2001 .

[11]  W. Szpankowski.  Average Case Analysis of Algorithms on Sequences , 2001 .

[12]  Pavel A. Pevzner,et al.  Computational molecular biology : an algorithmic approach , 2000 .

[13]  Vladimír Dancík,et al.  Expected length of longest common subsequences , 1994 .

[14]  Joseph G. Deken.  Some limit results for longest common subsequences , 1979, Discret. Math..

[15]  Svante Janson,et al.  Random graphs , 2000, ZOR Methods Model. Oper. Res..

[16]  Svante Janson,et al.  Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.

[17]  B. Logan,et al.  A Variational Problem for Random Young Tableaux , 1977 .

[18]  Gonzalo Navarro,et al.  Bounding the Expected Length of Longest Common Subsequences and Forests , 1999, Theory of Computing Systems.

[19]  V. Chvátal,et al.  Longest common subsequences of two random sequences , 1975, Advances in Applied Probability.

[20]  Michel Loève,et al.  Probability Theory I , 1977 .