Masek, Paterson (Edit sequence Sequence Alignment)
Revision as of 08:55, 10 April 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(mn/log(n)$) == Space Complexity == $O(mn/log(n)$) words (https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/0022000080900021?via%3Dihub) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1980 == Reference == https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/0022000080900021?via%3Dihub")
Time Complexity
$O(mn/log(n)$)
Space Complexity
$O(mn/log(n)$) words
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1980