Database Similarity Searching(Bioinformatics ) Questions and Answers
Question 1. Local sequence alignments are necessary for many cases out of which one is repeated.
True
False
May be True or False
Can't say
Explanation:-
Answer: Option A. -> True Answer: (a).True
Question 2. One of the challenges in SWA is obtaining correct alignments in regions of low similarity between distantly related biological sequences.
True
False
May be True or False
Can't say
Explanation:-
Answer: Option A. -> True Answer: (a).True
Question 3. In SW algorithm, to align two sequences of lengths of m and n _________ time is required.
O(mn)
O(m²n)
O(m²n³)
O(mn²)
Explanation:-
Answer: Option B. -> O(m²n) Answer: (b).O(m²n)
Question 4. 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.
True
False
May be True or False
Can't say
Explanation:-
Answer: Option A. -> True Answer: (a).True
Question 5. Score can be negative in Smith–Waterman algorithm.
True
False
May be True or False
Can't say
Explanation:-
Answer: Option B. -> False Answer: (b).False
Question 6. The BLAST program was developed in _______
1992
1995
1990
1991
Explanation:-
Answer: Option C. -> 1990 Answer: (c).1990
Question 7. In sequence alignment by BLAST, each word from query sequence is typically _______ residues for protein sequences and _______ residues for DNA sequences.
ten, eleven
three, three
three, eleven
three, ten
Explanation:-
Answer: Option C. -> three, eleven Answer: (c).three, eleven
Question 8. In sequence alignment by BLAST, the second step is to search a sequence database for the occurrence of these words.
True
False
May be True or False
Can't say
Explanation:-
Answer: Option A. -> True Answer: (a).True
Question 9. A recent improvement in the implementation of BLAST is the ability to provide gapped alignment.
True
False
May be True or False
Can't say
Explanation:-
Answer: Option A. -> True Answer: (a).True
Question 10. The final step involves pairwise alignment by extending from the words in both directions while counting the alignment score using the same substitution matrix.
