Which of the following does not describe global alignment algorithm? – McqOptions

MCQOPTIONS

1.	Which of the following does not describe global alignment algorithm?
A.	It attempts to align every residue in every sequence
B.	It is most useful when the aligning sequences are similar and of roughly the same size
C.	It is useful when the aligning sequences are dissimilar
D.	It can use Needleman-Wunsch algorithm
Answer» D. It can use Needleman-Wunsch algorithm

Discussion

No Comment Found

Related MCQs

Shorter sequences require higher cutoffs for inferring homologous relationships than longer sequences.
Which of the following is incorrect regarding sequence homology?
Use of the dynamic programming method requires a scoring system for the comparison of symbol pairs, and a scheme for GAP penalties.
Another difficulty in Bayesian methods is deciding on the length of sequence that was duplicated.
When was the dot plot method, first described?
The GCG alignment programs have a RANDOMIZATION option, which shuffles the second sequence and calculates similarity scores between the unshuffled sequence and each of the shuffled copies.
Which of the following is not a description of dynamic programming algorithm?
Which of the following are not related to Needleman-Wunsch alignment algorithm?
Which of the following feature of Bayesian methods is the disadvantage of it?
The statistical analysis of alignment scores is much better understood for ________ than for _______