Wagner and Fischer (LCS Longest Common Subsequence)

From Algorithm Wiki

Revision as of 08:30, 10 April 2023 by Admin (talk | contribs)

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

Jump to navigation Jump to search

Time Complexity

$O(mn)$

Space Complexity

$O(mn)$ words

(https://dl.acm.org/doi/10.1145/360825.360861)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1974

Reference

https://dl.acm.org/citation.cfm?doid=321796.321811

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