Data compression: methods and theory
Data compression: methods and theory
On the inadequacy of tournament algorithms for theN-SCS problem
Information Processing Letters
Algorithms for finding patterns in strings
Handbook of theoretical computer science (vol. A)
Theory and algorithms for plan merging
Artificial Intelligence
On the Approximation of Shortest Common Supersequencesand Longest Common Subsequences
SIAM Journal on Computing
Upper bounds for the expected length of a longest common subsequence of two binary sequences
Random Structures & Algorithms
Sequence Comparision: Some Theory and Some Practice
Proceedings of the LITP Spring School on Theoretical Computer Science: Electronic Dictionaries and Automata in Computational Linguistics
MFCS '94 Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science 1994
On a speculated relation between chvátal–sankoff constants of several sequences
Combinatorics, Probability and Computing
| Hi-index | 0.00 |
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 γ(l)k such that f(n, k, l)→ γ(l)kn as n→∞, and we show that γ(l)k= Θ(k1/l−1) as k→∞. Bounds for the corresponding constants for the expected length of a shortest common supersequence are also presented.