Hsu and Du (Scheme 1) (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(rm \log(n/m)$ + rm) == Space Complexity == $O(rm)$ words (https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/0022000084900254) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1984 == Reference == https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/0022000084900254")

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

Jump to navigation Jump to search

Time Complexity

$O(rm \log(n/m)$ + rm)

Space Complexity

$O(rm)$ words

(https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/0022000084900254)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1984

Reference

https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/0022000084900254

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