Wagner and Fischer (LCS Longest Common Subsequence): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(mn)$ == Space Complexity == $O(mn)$, later $O(m+n)$ due to Hirschberg words (https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/360825.360861) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1974 == Reference == https://dl-acm-org.ezproxy.canberra.edu.au/citation.cfm?doid=321796.321811") |
No edit summary |
||
| Line 5: | Line 5: | ||
== Space Complexity == | == Space Complexity == | ||
$O(mn)$ | $O(mn)$ words | ||
(https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/360825.360861) | (https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/360825.360861) | ||
Latest revision as of 09:30, 10 April 2023
Time Complexity
$O(mn)$
Space Complexity
$O(mn)$ words
(https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/360825.360861)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1974
Reference
https://dl-acm-org.ezproxy.canberra.edu.au/citation.cfm?doid=321796.321811