Let f(n; k; l) be the expected length of a longest common subse-quence of l sequences of length n over an alphabet of size k. It is known that there are constants (l) k such that f(n; k; l) ! (l) k n, we show that (l) k = (k 1=l?1). Bounds for the corresponding constants for the expected length of a shortest common supersequence are also presented.

An Efron{Stein inequality for nonsymmetric statistics

Michael Steele

The Annals of Statistics

1986

Time Warps, String Edits, and Macromolecules: The theory and practice of sequence comparison

D Sankoo, J B Kruskal

Time Warps, String Edits, and Macromolecules: The…

1983

Longest common subsequence of two random sequences

David Vv Aclav Chvv Atal, Sankoo

Journal of Applied Probability

1975

Similar Papers

Loading similar papers…

Cite this paper

@article{Danck1995CommonSA,
title={Common Subsequences and Supersequences and their Expected Length},
author={Vlado Danc{\'i}k},
journal={Combinatorics, Probability & Computing},
year={1995},
volume={7},
pages={365-373}
}