Masek; Patterson (Edit distance Sequence Alignment)
Revision as of 07:54, 10 April 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(mn / log(n))$ == Space Complexity == $O(n)$ words (https://www.sciencedirect.com/science/article/pii/0022000080900021) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1980 == Reference == https://www.sciencedirect.com/science/article/pii/0022000080900021")
Time Complexity
$O(mn / log(n))$
Space Complexity
$O(n)$ words
(https://www.sciencedirect.com/science/article/pii/0022000080900021)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1980
Reference
https://www.sciencedirect.com/science/article/pii/0022000080900021