Figure 2. An example of D-Array based pruning.

The maximum allowed number of differences, z, is 4. When backward search reaches position i+1, the algorithm detects that at least 4 differences must exist (as indicated in D[i]), while only three are allowed according to z due to the previous mismatch at position j.