Abstract
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 γ (vanl) vank such that f(n, k, l) → γ (vanl) vank vann, we show that γ (vanl) vank =vanθ(k 1/l−1). Bounds for the corresponding constants for the expected length of a shortest common supersequence are also presented.
Most of the work was done while author was a postgraduate student at Warwick University, England. Partially supported by the EPSRC grant GR/J 17844.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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.
Václav Chvátal and David Sankoff. Longest common subsequence of two random sequences. Journal of Applied Probability, 12:306–315, 1975.
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.
William Feller. An Introduction to Probability Theory and its Applications, volume I. John Wiley & Sons, New York, third edition, 1968.
David E. Foulser, Ming Li, and Qiang Yang. Theory and algorithms for plan merging. Artificial Intelligence, 57:143–181, 1992.
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.
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.
D. Sankoff and J. B. Kruskal. Time Warps, String Edits, and Macromolecules: The theory and practice of sequence comparison. Addison-Wesley, Reading, Mass, 1983.
J. Michael Steele. An Efron-Stein inequality for nonsymmetric statistics. The Annals of Statistics, 14(2):753–758, 1986.
James A. Storer. Data Compression: Methods and Theory. Computer Science Press, Rockville, Maryland, 1988.
V. G. Timkovskii. Complexity of common subsequence and supersequence problems and related problems. Cybernetics, 25:565–580, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dančík, V. (1995). Common subsequences and supersequences and their expected length. In: Galil, Z., Ukkonen, E. (eds) Combinatorial Pattern Matching. CPM 1995. Lecture Notes in Computer Science, vol 937. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60044-2_34
Download citation
DOI: https://doi.org/10.1007/3-540-60044-2_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60044-2
Online ISBN: 978-3-540-49412-6
eBook Packages: Springer Book Archive