Skip to main content
. 2022 Apr 6;12(4):546. doi: 10.3390/biom12040546

Figure 1.

Figure 1

Two heuristic algorithms for pairwise sequence alignment. (A) A dynamic programming matrix, which is separated by several anchors, which is certain to be in the optimal path. (B) A shape-based bounded dynamic programming matrix in which the light blue block is calculation-free because these states are thought to be less likely to be in the optimal path.