Question

Which of the following is not a description of dynamic programming algorithm?

(a) A method of sequence alignment

(b) A method that can take gaps into account

(c) A method that requires a manageable number of comparisons

(d) This method doesn’t provide an optimal (highest scoring) alignment

I got this question in semester exam.

Question is from Dynamic Programming Algorithm for Sequence Alignment topic in portion Sequence Alignment of Bioinformatics

Answer 1

Right choice is (d) This method doesn’t provide an optimal (highest scoring) alignment

For explanation: The method of sequence alignment by dynamic programming provides an optimal (highest scoring) alignment as an output. The quality of the alignment between two sequences is calculated using a scoring system that favors the matching of related or identical amino acids and penalizes for poorly matched amino acids and gaps.