Question

Which of the following does not describe dynamic programming?

(a) The approach compares every pair of characters in the two sequences and generates an alignment, which is the best or optimal

(b) Global alignment algorithm is based on this method

(c) Local alignment algorithm is based on this method

(d) The method can be useful in aligning protein sequences to protein sequences only

I got this question in exam.

My question is based upon Global Sequence Alignment in section Sequence Alignment of Bioinformatics

Answer 1

Correct choice is (d) The method can be useful in aligning protein sequences to protein sequences only

The best I can explain: The method can be useful in aligning nucleotide to protein sequences as well. These programs first perform pair-wise alignment on each pair of sequences. Then, they perform local re-arrangements on these results, in order to optimize overlaps between multiple sequences.