

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