Which_of_the_following_is_untrue_about_Needleman-Wunsch_algorithm?$ – McqOptions

MCQOPTIONS

1.	Which_of_the_following_is_untrue_about_Needleman-Wunsch_algorithm?$
A.	It is an example of dynamic programming
B.	Basic idea here is to build up the best alignment by using optimal alignments of larger subsequences
C.	It was first used by Saul Needleman and Christian Wunsch
D.	It was first used in 1970
Answer» B. Basic idea here is to build up the best alignment by using optimal alignments of larger subsequences

Discussion

No Comment Found

Related MCQs

There are two types matrices involved in the study- score matrices and trace matrices.
Which of the following is untrue about Needleman-Wunsch algorithm?
The number of possible global alignments between two sequences of length N is _____
A dotplot is a visual and qualitative technique whereas the sequence alignment is an exact and quantitative measure of similarity of alignments.
Which_of_the_following_is_untrue_about_Needleman-Wunsch_algorithm?$
In Needleman-Wunsch algorithm, the gaps are scored -2.
Which of the following is untrue about Protein substitution matrices?
The substitution matrices are rarely used in this type of matching.
The alignment score is the sum of substitution scores and gap penalties in this type of algorithm.
The global sequence alignment is suitable when the two sequences are of dissimilar length, with a negligible degree of similarity throughout.