Use the backward component of the dynamic programing algorithm to find another optimal alignment of the characters

Question:

Use the backward component of the dynamic programing algorithm to find another optimal alignment of the characters of Figure 4.6. How many optimal alignments are there?

Figure 4.6

BAADD CABD DA 0 1 2 3 4 5 6 7 8 9 10 11 B 1 0 1 2 3 4 5 6 7 8 9 10 B2 1 2 3 4 5 6 76 7 8 9 A 32 1 2 3 4 5 6 7

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Question Posted: