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.
This author was supported by an East European Scholarship from the University of Warwick and an ORS Award from the CVCP.
This author was partially supported by the ESPRIT II BRA Programme of the EC under contract 7141 (ALCOM II).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Václav Chvátal and David Sankoff. Longest common subsequence of two random sequences. Journal of Applied Probability, 12:306–315, 1975.
Joseph G. Deken. Some limit results for longest common subsequences. Discrete Mathematics, 26:17–31, 1979.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dančík, V., Paterson, M. (1994). Upper bounds for the expected length of a longest common subsequence of two binary sequences. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds) STACS 94. STACS 1994. Lecture Notes in Computer Science, vol 775. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57785-8_180
Download citation
DOI: https://doi.org/10.1007/3-540-57785-8_180
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57785-0
Online ISBN: 978-3-540-48332-8
eBook Packages: Springer Book Archive