Needleman–Wunsch algorithm (Edit sequence, global alignment Sequence Alignment)

From Algorithm Wiki

Revision as of 10:33, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(mn)$ == Space Complexity == $O(mn)$ words (Uses an m*n array, whose contents are of size O(1)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1970 == Reference == https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/0022283670900574")

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

Jump to navigation Jump to search

Time Complexity

$O(mn)$

Space Complexity

$O(mn)$ words

(Uses an m*n array, whose contents are of size O(1))

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1970

Reference

https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/0022283670900574

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Needleman–Wunsch_algorithm_(Edit_sequence,_global_alignment_Sequence_Alignment)&oldid=44439"