Which of the following statements is CORRECT?
a) Local alignments are most useful when the query set has similar sequences, it attempts to align every residue in those sequences.
b) Global alignments identify regions of similarity within long sequences that are often widely divergent overall.
c) Dynamic programming methods like the Needleman-Wunsch and the Smith-Waterman algorithms are the most useful to perform large-scale database searches.
d) Unlike dynamic programming methods, k-tuple methods like FASTA and BLAST are heuristics that guarantee to find an optimal alignment solution.
e) None of the above.
Original idea by: Raphael Cristofaro
Nenhum comentário:
Postar um comentário