Bounding the Expected Length of Longest Common Subsequences and Forests

Abstract. We present improvements to two techniques to find lower and upper bounds for the expected length of longest common subsequences and forests of two random sequences of the same length, over a fixed size, uniformly distributed alphabet. We emphasize the power of the methods used, which are Markov chains and Kolmogorov complexity. As a corollary, we obtain some new lower and upper bounds for the problems addressed as well as some new exact results for short sequences.

[1]  G. H. Gonnet,et al.  Handbook of algorithms and data structures: in Pascal and C (2nd ed.) , 1991 .

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

[3]  David Maier,et al.  The Complexity of Some Problems on Subsequences and Supersequences , 1978, JACM.

[4]  David Sankoff,et al.  Longest common subsequences of two random sequences , 1975, Advances in Applied Probability.

[5]  Mike Paterson,et al.  Longest Common Subsequences , 1994, MFCS.

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

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

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

[9]  David Sankoff,et al.  Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison , 1983 .

[10]  Pavel A. Pevzner,et al.  Generalized Sequence Alignment and Duality , 1993 .

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

[12]  David R. Cox,et al.  The Theory of Stochastic Processes , 1967, The Mathematical Gazette.

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

[14]  Tao Jiang,et al.  On the Approximation of Shortest Common Supersequences and Longest Common Subsequences , 1995, SIAM J. Comput..

[15]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.