Rick (LCS Longest Common Subsequence)

From Algorithm Wiki

Revision as of 09:27, 28 April 2023 by Admin (talk | contribs)

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

Jump to navigation Jump to search

Time Complexity

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

Space Complexity

$O(sn + p)$ words

(https://link-springer-com.ezproxy.canberra.edu.au/chapter/10.1007/3-540-60044-2_53)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1995

Reference

https://link-springer-com.ezproxy.canberra.edu.au/chapter/10.1007/3-540-60044-2_53

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