Wu et al. (LCS Longest Common Subsequence)
Jump to navigation
Jump to search
Time Complexity
$O(n(m-r)$)
Space Complexity
$O(m^{2})$? words
(Derived: Same as the above two)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1990