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» C. It was first used by Saul Needleman and Christian Wunsch

Discussion

No Comment Found

Related MCQs

Which of the following is untrue regarding Expectation Maximization algorithm?
In the initial step of EM algorithm, the 20-residue-long binding motif patterns in each sequence are aligned as an initial guess of the motif.
The program Profilemake can be used to produce a profile from an MSA.
Out of the two repeated steps in EM algorithm, the step 2 is ________
The pattern searching method type of analysis was performed on groups of related proteins, and the amino acid patterns that were located may be found in the Prosite catalog.
Which of the following about the Gibbs sampler is untrue?
Analysis of MSAs for conserved blocks of sequence leads to production of the position-specific scoring matrix.
Which of the following is untrue about CLUSTAL program?
Which of the following is not among the methods for finding localized sequence similarity?
The number of possible global alignments between two sequences of length N is _____