

MCQOPTIONS
Saved Bookmarks
1. |
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 |
Answer» E. | |