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

Q. By whom and when were the Bayesian methods applied first?

View solution

Q. With the application of Bayesian methods, the most probable repeat length and evolutionary time since the repeat was formed may be derived.

View solution

Q. If the purpose is to calculate the probability of one event AND a second event, the odds scores for the events are _________

View solution

Q. In a type of probability, analysis is to calculate the odds score for one event OR a second event, or of a series of events. In this case, the odds scores are _______

View solution

Q. In Bayesian methods, difficulty with making estimations is that the estimate depends on the following Assumption.
(Assumption – The mutation rate in sequences has been constant with time and that the rate of mutation of all nucleotides is the same.)

View solution

Q. Another difficulty in Bayesian methods is deciding on the length of sequence that was duplicated.

View solution

Q. A length and distance that gives the highest overall probability may then be determined. Such alignments are initially found using ________

View solution

Q. Which of the following feature of Bayesian methods is the disadvantage of it?

View solution

Q. Zhu (1998) have devised a computer program called the Bayes block aligner which in effect slides ____ sequences along each other to find the ______ ungapped regions or blocks.

View solution