Questions and answers for exam Preparation

MCQs

Total Questions : 150 | Page 13 of 15 pages

Question 121. Who suggested that the global alignment scores between unrelated protein sequences followed the extreme value distribution, similar to local alignment scores? And when?

Abagyan and Batalov, in 1981
Chvátal and Lipman, in 1984
Abagyan and Batalov, in 1997
Chvátal and Sankoff, in 1995

Discuss Question

Answer: Option C. -> Abagyan and Batalov, in 1997
Answer: (c).Abagyan and Batalov, in 1997

Question 122. _______ analyzed the distribution of scores among 100 vertebrate nucleic acid sequences and compared these scores with randomized sequences prepared in different ways.

Lipman, in 1984
Batalov, in 1964
Waterman, in 1987
Lipman, in 1967

Discuss Question

Answer: Option A. -> Lipman, in 1984
Answer: (a).Lipman, in 1984

Question 123. 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?

For finding repeated regions within a sequence
For finding similar regions that are in a different order in two sequences
For finding small conserved region such as an active site
For finding huge regions within sequences

Discuss Question

Answer: Option D. -> For finding huge regions within sequences
Answer: (d).For finding huge regions within sequences

Question 124. 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.

lowest
higher
lower
moderate

Discuss Question

Answer: Option C. -> lower
Answer: (c).lower

Question 125. 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.

True
False
May be True or False
Can't say

Discuss Question

Answer: Option A. -> True
Answer: (a).True

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

True
False
May be True or False
Can't say

Discuss Question

Answer: Option A. -> True
Answer: (a).True

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

a particular scoring matrix only
an alignment algorithm only
an alignment algorithm and a particular scoring matrix
dot method

Discuss Question

Answer: Option C. -> an alignment algorithm and a particular scoring matrix
Answer: (c).an alignment algorithm and a particular scoring matrix

Question 128. Unlike the commonly used methods for aligning a pair of sequences, the Bayesian method _______ using a particular scoring matrix or designated gap penalties.

does not depend on
depends on
is based on
involves

Discuss Question

Answer: Option A. -> does not depend on
Answer: (a).does not depend on

Question 129. 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.

two, least scoring
two, highest scoring
multiple, highest scoring
multiple, least scoring

Discuss Question

Answer: Option B. -> two, highest scoring
Answer: (b).two, highest scoring

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

A length and distance that gives the highest overall probability may be determined
They are used to calculate evolutionary distance
Computationally Bayesian methods are better
A specific mutational model is required

Discuss Question

Answer: Option D. -> A specific mutational model is required
Answer: (d).A specific mutational model is required