Skip to main content
. 2003 Apr 1;13(4):721–731. doi: 10.1101/gr.926603

Figure 4.

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).