

MCQOPTIONS
Saved Bookmarks
This section includes 13 Mcqs, each offering curated multiple-choice questions to sharpen your Bioinformatics knowledge and support exam preparation. Choose a topic below to get started.
1. |
Which of the following is untrue about DCA? |
A. | It stands for Divide-and-Conquer Alignment |
B. | It works by breaking each of the sequences into two smaller sections |
C. | The breaking points during the process are determined based on regional similarity of the sequences |
D. | If the sections are not short enough, further divisions are restricted as well |
Answer» E. | |
2. |
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. |
A. | True |
B. | False |
Answer» B. False | |
3. |
In a multidimensional search matrix, for aligning N sequences, an (N+2)-dimensional matrix is needed to be filled with alignment scores. |
A. | True |
B. | False |
Answer» C. | |
4. |
WHICH_OF_THE_FOLLOWING_IS_UNTRUE_ABOUT_DCA??$ |
A. | It stands for Divide-and-Conquer Alignment |
B. | It works by breaking each of the sequences into two smaller sections |
C. | The breaking points during the process are determined based on regional similarity of the sequences |
D. | If the sections are not short enough, further divisions are restricted as well |
Answer» E. | |
5. |
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? |
A. | True |
B. | False |
Answer» B. False | |
6. |
In a multidimensional search matrix, for aligning N sequences, an (N+2)-dimensional matrix is needed to be filled with alignment scores? |
A. | True |
B. | False |
Answer» C. | |
7. |
There are two approaches viz. exhaustive and heuristic approaches used in multiple sequence alignment. |
A. | True |
B. | False |
Answer» B. False | |
8. |
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. |
A. | True |
B. | False |
Answer» C. | |
9. |
Which of the following scores are not considered while calculating the SP scores? |
A. | All possible pair wise matches |
B. | All possible mismatches |
C. | All possible gap costs |
D. | Number of gap penalties |
Answer» E. | |
10. |
The scoring function for multiple sequence alignment is based on the concept of sum of pairs (SP). |
A. | True |
B. | False |
Answer» B. False | |
11. |
Which of the following cannot be related to multiple sequence alignment? |
A. | Many conserved and functionally critical amino acid residues can be identified in a protein multiple alignment |
B. | Multiple sequence alignment is also an essential prerequisite to carrying out phylogenetic analysis of sequence families and prediction of protein secondary and tertiary structures |
C. | Multiple sequence alignment also has applications in designing degenerate polymerase chain reaction (PCR) primers based on multiple related sequences |
D. | This method does not contribute much to degenerate polymerase chain reaction (PCR) primers creation |
Answer» E. | |
12. |
There is a unique advantage of multiple sequence alignment because it reveals more biological information than many pair wise alignments can. |
A. | True |
B. | False |
Answer» B. False | |
13. |
Related sequences are identified through the database similarity searching and as the process generates multiple matching sequence pairs, it is often necessary to convert the numerous pair wise alignments into a single alignment. |
A. | True |
B. | False |
Answer» B. False | |