Wagner and Fischer (LCS Longest Common Subsequence)

From Algorithm Wiki

Revision as of 10:32, 15 February 2023 by Admin (talk | contribs) (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")

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

Jump to navigation Jump to search

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

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