Advertisement

Upper bounds for the expected length of a longest common subsequence of two binary sequences

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

Abstract

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.

Classification

computational complexity average-case analysis stringmatching 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Václav Chvátal and David Sankoff. Longest common subsequence of two random sequences. Journal of Applied Probability, 12:306–315, 1975.Google Scholar
  2. 2.
    Joseph G. Deken. Some limit results for longest common subsequences. Discrete Mathematics, 26:17–31, 1979.Google Scholar
  3. 3.
    Joseph G. Deken. Probabilistic behavior of longest-common-subsequence length. In D. Sankoff and J. B. Kruskal, editors, Time Warps, String Edits, and Macromolecules: The theory and practice of sequence comparison, chapter 16, pages 359–362. Addison-Wesley, Reading, Mass, 1983.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Vlado Dančík
    • 1
  • Mike Paterson
    • 1
  1. 1.Department of Computer ScienceUniversity of WarwickCoventryEngland

Personalised recommendations