MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 14 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 regarding BLAST and FASTA? |
| A. | FASTA is faster than BLAST |
| B. | FASTA is the most accurate |
| C. | BLAST has limited choices of databases |
| D. | FASTA is more sensitive for DNA-DNA comparisons |
| Answer» B. FASTA is the most accurate | |
| 2. |
Which of the following does not describe BLAST? |
| A. | It stands for Basic Local Alignment Search Tool |
| B. | It uses word matching like FASTA |
| C. | It is one of the tools of the NCBI |
| D. | Even if no words are similar, there is an alignment to be considered |
| Answer» E. | |
| 3. |
Local alignments are more used when _____________ |
| A. | There are totally similar and equal length sequences |
| B. | Dissimilar sequences are suspected to contain regions of similarity |
| C. | Similar sequence motif with larger sequence context |
| D. | Partially similar, different length and conserved region containing sequences |
| Answer» B. Dissimilar sequences are suspected to contain regions of similarity | |
| 4. |
Which of the following does not describe local alignment algorithm? |
| A. | Score can be negative |
| B. | Negative score is set to 0 |
| C. | First row and first column are set to 0 in initialization step |
| D. | In traceback step, beginning is with the highest score, it ends when 0 is encountered |
| Answer» B. Negative score is set to 0 | |
| 5. |
When did Smith–Waterman first describe the algorithm for local alignment? |
| A. | 1950 |
| B. | 1970 |
| C. | 1981 |
| D. | 1925 |
| Answer» D. 1925 | |
| 6. |
WHICH_OF_THE_FOLLOWING_DOES_NOT_DESCRIBE_BLAST??$ |
| A. | It stands for Basic Local Alignment Search Tool |
| B. | It uses word matching like FASTA |
| C. | It is one of the tools of the NCBI |
| D. | Even if no words are similar, there is an alignment to be considered |
| Answer» E. | |
| 7. |
Which_of_the_following_is_untrue_regarding_BLAST_and_FASTA?$ |
| A. | FASTA is faster than BLAST |
| B. | FASTA is the most accurate |
| C. | BLAST has limited choices of databases |
| D. | FASTA is more sensitive for DNA-DNA comparisons |
| Answer» B. FASTA is the most accurate | |
| 8. |
Which of the following does not describe k-tuple methods? |
| A. | k-tuple methods are best known for their implementation in the database search tools FASTA and the BLAST family |
| B. | They are also known as words methods |
| C. | They are basically heuristic methods to find local alignment |
| D. | They are useful in small scale databases |
| Answer» E. | |
| 9. |
Among the following which one is not the approach to the local alignment? |
| A. | Smith–Waterman algorithm |
| B. | K-tuple method |
| C. | Words method |
| D. | Needleman-Wunsch algorithm |
| Answer» E. | |
| 10. |
Which of the following is untrue regarding the gap penalty used in dynamic programming? |
| A. | Gap penalty is subtracted for each gap that has been introduced |
| B. | Gap penalty is added for each gap that has been introduced |
| C. | The gap score defines a penalty given to alignment when we have insertion or deletion |
| D. | Gap open and gap extension has been introduced when there are continuous gaps (five or more) |
| Answer» C. The gap score defines a penalty given to alignment when we have insertion or deletion | |
| 11. |
Which of the following does not describe BLOSUM matrices? |
| A. | It stands for BLOcks SUbstitution Matrix |
| B. | It was developed by Henikoff and Henikoff |
| C. | The year it was developed was 1992 |
| D. | These matrices are logarithmic identity values |
| Answer» E. | |
| 12. |
Local alignments are more used when_____________ |
| A. | There are totally similar and equal length sequences |
| B. | Dissimilar sequences are suspected to contain regions of similarity |
| C. | Similar sequence motif with larger sequence context |
| D. | Partially similar, different length and conserved region containing sequences |
| Answer» B. Dissimilar sequences are suspected to contain regions of similarity | |
| 13. |
Which of the following does not describe local alignment? |
| A. | A local alignment aligns a substring of the query sequence to a substring of the target sequence |
| B. | 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 |
| C. | Local alignments have terminal gaps |
| D. | 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 |
| Answer» D. 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 | |
| 14. |
When did Smith–Waterman first describe the algorithm for local alignment? |
| A. | 1950 |
| B. | 1970 |
| C. | 1981 |
| D. | 1925 |
| Answer» D. 1925 | |