Question
a.
The method compares every pair of characters in the two sequences and generates an alignment
b.
The output alignment will include matched and mismatched characters and gaps in the two sequences that are positioned so that the number of matches between identical or related characters is the maximum possible
c.
The dynamic programming algorithm provides a reliable computational method for aligning DNA and protein sequences
d.
This doesn’t allow making evolutionary predictions on the basis of sequence alignments
Posted under Bioinformatics
Interact with the Community - Share Your Thoughts
Uncertain About the Answer? Seek Clarification Here.
Understand the Explanation? Include it Here.
Q. Which of the following is untrue regarding dynamic programming algorithm?
Similar Questions
Explore Relevant Multiple Choice Questions (MCQs)
Q. In scoring matrices, for convenience, odds scores are converted to log odds scores.
View solution
Q. Which of the following doesn’t describe PAM matrices?
View solution
Q. The assumption in this evolutionary model is that the amino acid substitutions observed over short periods of evolutionary history can be extrapolated to longer distances.
View solution
Q. Which of the following is untrue about the modification of PAM matrices?
View solution
Q. The Dayhoff model of protein evolution is not a Markov process.
View solution
Q. Which of the following is true regarding the assumptions in the method of constructing the Dayhoff scoring matrix?
View solution
Q. The more conserved amino acids in similar proteins from different species are ones that play an essential role in structure and function and the less conserved are in sites that can vary without having a significant effect on function.
View solution
Q. A gap opening penalty for any gap (g) and a gap extension penalty for each element in the gap (r) are most often used, to give a total gap score wx, according to the equation ______
View solution
Q. In the GCG and FASTA program suites, the scoring matrix itself is formatted in a way that includes default ______
View solution
Q. In case of the varying alignment, penalizing gaps heavily might occur. Then the best scoring local alignment between the sequences will be one that optimizes the score between matches and mismatches, without any gaps.
View solution
Q. On analysis of the alignment scores of random sequences will reveal that the scores follow a different distribution than the normal distribution called the _________
View solution
Q. The statistical analysis of alignment scores is much better understood for ________ than for _______
View solution
Q. When random or unrelated sequences are compared using a global alignment method, they can have ____________ reflecting the tendency of the global algorithm to match as many characters as possible.
View solution
Q. Which of the following are not related to Needleman-Wunsch alignment algorithm?
View solution
Q. Waterman, in1989, provided a set of means and standard deviations of global alignment scores between random DNA sequences, using mismatch and gap penalties that produce a linear increase in score with _______ a distinguishing feature of global alignments.
View solution
Q. Who suggested that the global alignment scores between unrelated protein sequences followed the extreme value distribution, similar to local alignment scores? And when?
View solution
Q. _______ analyzed the distribution of scores among 100 vertebrate nucleic acid sequences and compared these scores with randomized sequences prepared in different ways.
View solution
Q. If the random sequences were prepared in a way that maintained the local base composition by producing them from overlapping fragments of sequence, the distribution of scores has a _______ standard deviation that is closer to the distribution of the natural sequences.
View solution
Q. 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.
View solution
Q. Dayhoff, 1978- 1983, devised a second method for testing the relatedness of two protein sequences that can accommodate some local variation. Where this method is useful?
View solution
Recommended Subjects
Are you eager to expand your knowledge beyond Bioinformatics? We've handpicked a range of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of various subjects. Happy exploring!