Nakatsu et al. (LCS Longest Common Subsequence)

From Algorithm Wiki
Revision as of 12:14, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Nakatsu_et_al._(LCS_Longest_Common_Subsequence)&oldid=45222"