Miller and Myers (LCS Longest Common Subsequence)
Jump to navigation
Jump to search
Time Complexity
$O(n(m-r)$)
Space Complexity
$O(m^{2})$ words
(Derived: Uses an upper triangular matrix $M$ that is size $(m + 1) \times (m + 1)$)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1985
Reference
https://onlinelibrary.wiley.com/doi/abs/10.1002/spe.4380151102