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

Authors:
Vlado Dančík;Mike Paterson
Affiliations:
-;-
Venue:
Random Structures & Algorithms
Year:
1995

Citing 0
Cited 4

Improved bounds on the average length of longest common subsequences

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Common Subsequences and Supersequences and their Expected Length

Combinatorics, Probability and Computing
Improved bounds on the average length of longest common subsequences

Journal of the ACM (JACM)
On a speculated relation between chvátal–sankoff constants of several sequences

Combinatorics, Probability and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract