Home - Bioinformatics - Database Similarity Searching

Database Similarity Searching Online Exam Quiz

Important questions about Database Similarity Searching. Database Similarity Searching MCQ questions with answers. Database Similarity Searching exam questions and answers for students and interviews.

The main application of pairwise alignment is retrieving biological sequences in databases based on similarity.

Options

A : a. True

B : b. False

C : c. May be True or False

D : d. Can't say

Dynamic programming method is the fastest and most practical method.

Options

A : a. True

B : b. False

C : c. May be True or False

D : d. Can't say

Which of the following is not one of the requirements for implementing algorithms for sequence database searching?

Options

A : a. Size of the dataset

B : b. Sensitivity

C : c. Specificity

D : d. Speed

Sensitivity refers to the ability to find as many correct hits as possible.

Options

A : a. True

B : b. False

C : c. May be True or False

D : d. Can't say

The specificity refers to the ability to include incorrect hits.

Options

A : a. True

B : b. False

C : c. May be True or False

D : d. Can't say

In heuristic methods, speed doesn’t vary with the size of database.

Options

A : a. True

B : b. False

C : c. May be True or False

D : d. Can't say

An increase in sensitivity is associated with _______ in selectivity.

Options

A : a. no specific change

B : b. increase

C : c. decrease

D : d. exponential increase

Currently, there are two major heuristic algorithms for performing database searches: BLAST and FASTA.

Options

A : a. True

B : b. False

C : c. May be True or False

D : d. Can't say

Which of the following is incorrect the ‘word’ method?

Options

A : a. Both BLAST and FASTA use a heuristic word method

B : b. Word method is used for fast pairwise sequence alignment in BLAST and FASTA

C : c. The basic assumption is that two related sequences must have at least one word in common

D : d. Two related sequences must have at zero word in common while assuming

The BLAST program was developed in _______

Options

A : a. 1992

B : b. 1995

C : c. 1990

D : d. 1991

In sequence alignment by BLAST, each word from query sequence is typically _______ residues for protein sequences and _______ residues for DNA sequences.

Options

A : a. ten, eleven

B : b. three, three

C : c. three, eleven

D : d. three, ten

In sequence alignment by BLAST, the second step is to search a sequence database for the occurrence of these words.

Options

A : a. True

B : b. False

C : c. May be True or False

D : d. Can't say

The final step involves pairwise alignment by extending from the words in both directions while counting the alignment score using the same substitution matrix.

Options

A : a. True

B : b. False

C : c. May be True or False

D : d. Can't say

A recent improvement in the implementation of BLAST is the ability to provide gapped alignment.

Options

A : a. True

B : b. False

C : c. May be True or False

D : d. Can't say

Which of the following is not a variant of BLAST?

Options

A : a. BLASTN

B : b. BLASTP

C : c. BLASTX

D : d. TBLASTNX

BLASTX uses protein sequences as queries to search against a protein sequence database.

Options

A : a. True

B : b. False

C : c. May be True or False

D : d. Can't say

TBLASTX queries protein sequences to anucleotide sequence database with the sequences translated in all six reading frames.

Options

A : a. True

B : b. False

C : c. May be True or False

D : d. Can't say

Which of the following is not correct about BLAST?

Options

A : a. The BLAST web server has been designed in such away as to simplify the task of program selection

B : b. The programs are organized based on the type of query sequences

C : c. The programs are organized based on the type of nucleotide sequences, or nucleotide sequence to be translated

D : d. BLAST is not based on heuristic searching methods

If one is looking for protein homologs encoded in newly sequenced genomes, one may use TBLASTN, which translates nucleotide database sequences in all six open reading frames.

Options

A : a. True

B : b. False

C : c. May be True or False

D : d. Can't say

Which of the following is not correct about FASTA?

Options

A : a. Its stands for FAST ALL

B : b. It was in fact the first database similarity search tool developed, preceding the development of BLAST

C : c. FASTA uses a ‘hashing’ strategy to find matches for a short stretch of identical residues with a length of k

D : d. The string of residues is known as blocks

Bioinformatics more Online Exam Quiz

Copyright © 2021
Exam-GK-MCQ-Questions.Com | Contact Us | Privacy Policy | Terms of Use | Sitemap | 0.019145965576172