Masek; Patterson (Edit distance, constant-size alphabet Sequence Alignment)

From Algorithm Wiki

Revision as of 10:33, 15 February 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?via%3Dihub) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1980 == Reference == https://www.sciencedirect.com/science/article/pii/0022000080900021")

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

Jump to navigation Jump to search

Time Complexity

$O(mn / log(n))$

Space Complexity

$O(n)$ words

(https://www.sciencedirect.com/science/article/pii/0022000080900021?via%3Dihub)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1980

Reference

https://www.sciencedirect.com/science/article/pii/0022000080900021

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Masek;_Patterson_(Edit_distance,_constant-size_alphabet_Sequence_Alignment)&oldid=44441"