Common subsequences and supersequences and their expected length

  • Vlado Dančík
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 937)


Let f(n,k,l) be the expected length of a longest common subsequence of l sequences of length n over an alphabet of size k. It is known that there are constants γ vank (vanl) such that f(n, k, l) → γ vank (vanl) vann, we show that γ vank (vanl) =vanθ(k1/l−1). Bounds for the corresponding constants for the expected length of a shortest common supersequence are also presented.


Lower Bound Kolmogorov Complexity 11th Annual Symposium Longe Common Subsequence Information Processing Letter 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    James H. Bradford and T. A. Jenkyns. On the inadequacy of tournament algorithms for the n-scs problem. Information Processing Letters, 38(4):169–171, 1991.CrossRefGoogle Scholar
  2. 2.
    Václav Chvátal and David Sankoff. Longest common subsequence of two random sequences. Journal of Applied Probability, 12:306–315, 1975.Google Scholar
  3. 3.
    Vlado Dančík and Mike Paterson. Upper bounds for the expected length of a longest common subsequence of two binary sequences. In P. Enjalbert, E. W. Mayr, and K.W.Wagner, editors, 11th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings, pages 669–678. Lecture Notes in Computer Science 775, Springer-Verlag, 1994.Google Scholar
  4. 4.
    William Feller. An Introduction to Probability Theory and its Applications, volume I. John Wiley & Sons, New York, third edition, 1968.Google Scholar
  5. 5.
    David E. Foulser, Ming Li, and Qiang Yang. Theory and algorithms for plan merging. Artificial Intelligence, 57:143–181, 1992.Google Scholar
  6. 6.
    Tao Jiang and Ming Li. On the approximation of shortest common supersequences and longest common subsequences. In S. Abiteboul and E. Shamir, editors, Automata, Languages and Programming, Proceedings, pages 191–202. Lecture Notes in Computer Science 820, Springer-Verlag, 1994.Google Scholar
  7. 7.
    Mike Paterson and Vlado Dančík. Longest common subsequences. In 19th International Symposium Mathematical Foundations of Computer Science, Proceedings, pages 127–142. Lecture Notes in Computer Science 841, Springer-Verlag, 1994.Google Scholar
  8. 8.
    D. Sankoff and J. B. Kruskal. Time Warps, String Edits, and Macromolecules: The theory and practice of sequence comparison. Addison-Wesley, Reading, Mass, 1983.Google Scholar
  9. 9.
    J. Michael Steele. An Efron-Stein inequality for nonsymmetric statistics. The Annals of Statistics, 14(2):753–758, 1986.Google Scholar
  10. 10.
    James A. Storer. Data Compression: Methods and Theory. Computer Science Press, Rockville, Maryland, 1988.Google Scholar
  11. 11.
    V. G. Timkovskii. Complexity of common subsequence and supersequence problems and related problems. Cybernetics, 25:565–580, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Vlado Dančík
    • 1
  1. 1.Department of Computer ScienceKing's College LondonLondonEngland

Personalised recommendations