Questions and answers for exam Preparation

MCQs

Total Questions : 80 | Page 8 of 8 pages

Question 71. Given a multiple alignment of three sequences, the sum of scores is calculated as the sum of the dissimilarity scores of every pair of sequences at each position.

True
False
May be True or False
Can't say

Discuss Question

Answer: Option B. -> False
Answer: (b).False

Question 72. Which of the following is untrue about DCA?

It stands for Divide-and-Conquer Alignment
It works by breaking each of the sequences into two smaller sections
The breaking points during the process are determined based on regional similarity of the sequences
If the sections are not short enough, further divisions are restricted as well

Discuss Question

Answer: Option D. -> If the sections are not short enough, further divisions are restricted as well
Answer: (d).If the sections are not short enough, further divisions are restricted as well

Question 73. As the amount of computational time and memory space required increases exponentially with the number of sequences, it makes the multidimensional search matrix method computationally prohibitive to use for a large data set.

True
False
May be True or False
Can't say

Discuss Question

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

Question 74. There are two approaches viz. exhaustive and heuristic approaches used in multiple sequence alignment.

True
False
May be True or False
Can't say

Discuss Question

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

Question 75. In a multidimensional search matrix, for aligning N sequences, an (N+2)-dimensional matrix is needed to be filled with alignment scores.

True
False
May be True or False
Can't say

Discuss Question

Answer: Option B. -> False
Answer: (b).False

Question 76. The initial alignments used to produce the guide tree may be obtained by various methods. Which of the following is not one of them?

Fast k-tuple
pattern-finding approach similar
FASTA
Faster, full dynamic programming method

Discuss Question

Answer: Option D. -> Faster, full dynamic programming method
Answer: (d).Faster, full dynamic programming method

Question 77. Like other alignment programs, CLUSTAL uses a null score for opening a gap in a sequence alignment and a penalty for extending the gap by one residue.

True
False
May be True or False
Can't say

Discuss Question

Answer: Option B. -> False
Answer: (b).False

Question 78. The scoring of gaps in a MSA (Multiple Sequence Alignment) has to be performed in a different manner from scoring gaps in a pair-wise alignment.

True
False
May be True or False
Can't say

Discuss Question

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

Question 79. Which of the following is untrue about PILEUP program?

It is the MSA program that is a part of the Genetics Computer Group package of sequence analysis programs
It is owned since 1997 by Oxford Communications and is widely used due to the popularity and availability of this package
It uses a method for MSA that is polar opposite to CLUSTALW
The sequences are aligned pair-wise using the Needleman- Wunsch dynamic programming algorithm

Discuss Question

Answer: Option C. -> It uses a method for MSA that is polar opposite to CLUSTALW
Answer: (c).It uses a method for MSA that is polar opposite to CLUSTALW

Question 80. The resulting tree is then used to guide the alignment of the most closely related sequences and groups of sequences. The resulting alignment is a global alignment produced by the Needleman-Wunsch algorithm.