Nakatsu et al. (LCS Longest Common Subsequence)
Jump to navigation
Jump to search
Time Complexity
$O(n(m-r)$)
Space Complexity
$O(m^{2})$ words
(https://link-springer-com.ezproxy.canberra.edu.au/content/pdf/10.1007/3-540-58338-6_63.pdf, Fig. 3)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1982
Reference
https://link-springer-com.ezproxy.canberra.edu.au/article/10.1007/BF00264437