Nakatsu et al. (LCS Longest Common Subsequence)

Time Complexity

$O(n(m-r)$)

Space Complexity

$O(m^{2})$ words

(https://link.springer.com/content/pdf/10.1007/3-540-58338-6_63.pdf, Fig. 3)

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1982

Reference

https://link.springer.com/article/10.1007/BF00264437