The needleman and Wunsch algorithm for global alignment
Needleman and Wunsch (1970)
proposed a maximum-match pathway that
can be obtained computationally by applying a straightforward algorithm. In its
simplest form, cells representing
identities are scored 1, and cells representing mismatches are scored 0; the 2D array is thus
populated with these values.