

MCQOPTIONS
Saved Bookmarks
This section includes 8 Mcqs, each offering curated multiple-choice questions to sharpen your Bioinformatics knowledge and support exam preparation. Choose a topic below to get started.
1. |
The function of the scoring matrix is to conduct one-to-one comparisons between all components in two sequences and record the optimal alignment results. |
A. | True |
B. | False |
Answer» B. False | |
2. |
Score can be negative in Smith Waterman algorithm. |
A. | True |
B. | False |
Answer» C. | |
3. |
One of the challenges in SWA is obtaining correct alignments in regions of low similarity between distantly related biological sequences. |
A. | True |
B. | False |
Answer» B. False | |
4. |
In SW algorithm, to align two sequences of lengths of m and n _________ time is required. |
A. | O(mn) |
B. | O(m<sup>2</sup>n) |
C. | O(m<sup>2</sup>n<sup>3</sup>) |
D. | O(mn<sup>2</sup>) |
Answer» C. O(m<sup>2</sup>n<sup>3</sup>) | |
5. |
Local sequence alignments are necessary for many cases out of which one is repeated. |
A. | True |
B. | False |
Answer» B. False | |
6. |
In Smith Waterman algorithm, in initialization Step, the _________ row and ________ column are subject to gap penalty. |
A. | first, first |
B. | first, second |
C. | second, First |
D. | first, last |
Answer» B. first, second | |
7. |
Par Align is a web-based server that uses parallel processors to perform exhaustive sequence comparisons using either a parallelized version of the Smith Waterman algorithm or a heuristic program for further speed gains. |
A. | True |
B. | False |
Answer» B. False | |
8. |
The rigorous dynamic programming method is normally not used for database searching because it is slow and computationally expensive. |
A. | True |
B. | False |
Answer» B. False | |