Figure 4.
Limited area of dynamic programming around an anchor. An anchor between (i, j) and (i‘, j‘) in the rough global alignment limits the search area of Needleman-Wunsch. The alignment is required to pass through the diagonal from (i − r, j + r) to (i + r, j − r), stay within the diagonals from (i − r,j + r) to (i‘ − r,j‘ + r) and from (i + r,j − r) to (i‘ + r,j‘ − r), and exit through the diagonal from (i‘ − r, j‘ + r) to (i‘ + r, j‘ − r).
