Questions and answers for exam Preparation

MCQs

Total Questions : 150 | Page 10 of 15 pages

Question 91. When did Smith–Waterman first describe the algorithm for local alignment?

1950
1970
1981
1925

Discuss Question

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

Question 92. Local alignments are more used when _____________

There are totally similar and equal length sequences
Dissimilar sequences are suspected to contain regions of similarity
Similar sequence motif with larger sequence context
Partially similar, different length and conserved region containing sequences

Discuss Question

Answer: Option A. -> There are totally similar and equal length sequences
Answer: (a).There are totally similar and equal length sequences

Question 93. Which of the following does not describe local alignment?

A local alignment aligns a substring of the query sequence to a substring of the target sequence
A local alignment is defined by maximizing the alignment score, so that deleting a column from either end would reduce the score, and adding further columns at either end would also reduce the score
Local alignments have terminal gaps
The substrings to be examined may be all of one or both sequences; if all of both are included then the local alignment is also global

Discuss Question

Answer: Option C. -> Local alignments have terminal gaps
Answer: (c).Local alignments have terminal gaps

Question 94. Which of the following does not describe BLOSUM matrices?

It stands for BLOcks SUbstitution Matrix
It was developed by Henikoff and Henikoff
The year it was developed was 1992
These matrices are logarithmic identity values

Discuss Question

Answer: Option D. -> These matrices are logarithmic identity values
Answer: (d).These matrices are logarithmic identity values

Question 95. Which of the following does not describe local alignment algorithm?

Score can be negative
Negative score is set to 0
First row and first column are set to 0 in initialization step
In traceback step, beginning is with the highest score, it ends when 0 is encountered

Discuss Question

Answer: Option A. -> Score can be negative
Answer: (a).Score can be negative

Question 96. Which of the following is untrue regarding the gap penalty used in dynamic programming?

Gap penalty is subtracted for each gap that has been introduced
Gap penalty is added for each gap that has been introduced
The gap score defines a penalty given to alignment when we have insertion or deletion
Gap open and gap extension has been introduced when there are continuous gaps (five or more)

Discuss Question

Answer: Option B. -> Gap penalty is added for each gap that has been introduced
Answer: (b).Gap penalty is added for each gap that has been introduced

Question 97. Among the following which one is not the approach to the local alignment?

Smith-Waterman algorithm
K-tuple method
Words method
Needleman-Wunsch algorithm

Discuss Question

Answer: Option D. -> Needleman-Wunsch algorithm
Answer: (d).Needleman-Wunsch algorithm

Question 98. Which of the following does not describe k-tuple methods?

k-tuple methods are best known for their implementation in the database search tools FASTA and the BLAST family
They are also known as words methods
They are basically heuristic methods to find local alignment
They are useful in small scale databases

Discuss Question

Answer: Option D. -> They are useful in small scale databases
Answer: (d).They are useful in small scale databases

Question 99. Which of the following does not describe BLAST?

It stands for Basic Local Alignment Search Tool
It uses word matching like FASTA
It is one of the tools of the NCBI
Even if no words are similar, there is an alignment to be considered

Discuss Question

Answer: Option D. -> Even if no words are similar, there is an alignment to be considered
Answer: (d).Even if no words are similar, there is an alignment to be considered

Question 100. Which of the following is untrue regarding BLAST and FASTA?