Chin and Poon (LCS Longest Common Subsequence)

From Algorithm Wiki

Revision as of 10:42, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(sn + \min\{sp, rm\})$ == Space Complexity == $O(p + n)$ 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 == 1991 == Reference == https://dl-acm-org.ezproxy.canberra.edu.au/citation.cfm?id=105592")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(sn + \min\{sp, rm\})$

Space Complexity

$O(p + n)$ 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

1991

Reference

https://dl-acm-org.ezproxy.canberra.edu.au/citation.cfm?id=105592

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