Chin and Poon (LCS Longest Common Subsequence)
Jump to navigation
Jump to search
Time Complexity
$O(sn + \min\{sp, rm\})$
Space Complexity
$O(p + n)$ words
(https://link.springer.com/content/pdf/10.1007/3-540-58338-6_63.pdf, Fig. 3)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1991