Common Subsequences and Supersequences and their Expected Length

  • Vlado Dancík
  • Published 1995 in Combinatorics, Probability & Computing

Abstract

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. 
DOI: 10.1007/3-540-60044-2_34

Topics

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} }