论文信息 - Upper Bounds for the Expected Length of a Longest Common Subsequence of Two Binary Sequences

Upper Bounds for the Expected Length of a Longest Common Subsequence of Two Binary Sequences

Let f(n) be the expected length of a longest common subsequence of two random binary sequences of length n. It is known that the limit c=lim f(n)/n exists. Improved upper bounds for c are given n→∞ using a new method.

Mike Paterson | Vlado Dancík | M. Paterson | V. Dancík

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

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