Questions and answers for exam Preparation

MCQs

Total Questions : 150 | Page 7 of 15 pages

Question 61. Which of the following is false in case of the database Pfam and its algorithm?

Each motif or domain is represented by an HMM profile generated from the seed alignment of a number of conserved homologous proteins
Since the probability scoring mechanism is more complex in HMM than in a profile-based approach the use of HMM yields further increases in sensitivity of the database matches
Pfam-B only contains sequence families not covered in Pfam
The functional annotation of motifs in Pfam-A is often related to that in UNIPROT

Discuss Question

Answer: Option D. -> The functional annotation of motifs in Pfam-A is often related to that in UNIPROT
Answer: (d).The functional annotation of motifs in Pfam-A is often related to that in UNIPROT

Question 62. Point out the wrong or irrelevant mathematical method in motif analysis.

Enumeration
Probabilistic Optimization
Deterministic Optimization
Literature mining

Discuss Question

Answer: Option D. -> Literature mining
Answer: (d).Literature mining

Question 63. Which of the following is false in case of the database InterPro and its algorithm?

InterPro is an integrated pattern database designed to unify multiple databases for protein domains and functional sites
This database integrates information from PROSITE, Pfam, PRINTS, ProDom, and SMART databases
Only overlapping motifs and domains in a protein sequence derived by all five databases are included
All the motifs and domains in a protein sequence derived by all five databases are included

Discuss Question

Answer: Option D. -> All the motifs and domains in a protein sequence derived by all five databases are included
Answer: (d).All the motifs and domains in a protein sequence derived by all five databases are included

Question 64. Which of the following is false in case of the database SMART and its algorithm?

Contains HMM profiles constructed from manually refined protein domain alignments
Alignments in the database are built based on tertiary structures whenever available or based on PSI-BLAST profiles
Alignments are further checked but not refined by human annotators before HMM profile construction
SMART stands for Simple Modular Architecture Research Tool

Discuss Question

Answer: Option C. -> Alignments are further checked but not refined by human annotators before HMM profile construction
Answer: (c).Alignments are further checked but not refined by human annotators before HMM profile construction

Question 65. Which of the following is false in case of the CDART and its algorithm?

CDART is a domain search program that combines the results from RPS-BLAST, SMART, and Pfam
The program is now an integral part of the regular BLAST search function
CDART is a substitute for individual database searches
It stands for Conserved Domain Architecture

Discuss Question

Answer: Option C. -> CDART is a substitute for individual database searches
Answer: (c).CDART is a substitute for individual database searches

Question 66. When did Needleman-Wunsch first describe the algorithm for global alignment?

1899
1970
1930
1950

Discuss Question

Answer: Option B. -> 1970
Answer: (b).1970

Question 67. Which of the following is not an advantage of Needleman-Wunsch algorithm?

New algorithmic improvements as well as increasing computer capacity make it possible to align a query sequence against a large DB in a few minutes
Similar sequence region is of same order and orientation
This does not help in determining evolutionary relationship
If you have 2 genes that are already understood as closely related, then this type of algorithm can be used to understand them in further details

Discuss Question

Answer: Option C. -> This does not help in determining evolutionary relationship
Answer: (c).This does not help in determining evolutionary relationship

Question 68. Which of the following does not describe dynamic programming?

The approach compares every pair of characters in the two sequences and generates an alignment, which is the best or optimal
Global alignment algorithm is based on this method
Local alignment algorithm is based on this method
The method can be useful in aligning protein sequences to protein sequences only

Discuss Question

Answer: Option D. -> The method can be useful in aligning protein sequences to protein sequences only
Answer: (d).The method can be useful in aligning protein sequences to protein sequences only

Question 69. Which of the following is not a disadvantage of Needleman-Wunsch algorithm?

This method is comparatively slow
There is a need of intensive memory
This cannot be applied on genome sized sequences
This method can be applied to even large sized sequences

Discuss Question

Answer: Option D. -> This method can be applied to even large sized sequences
Answer: (d).This method can be applied to even large sized sequences

Question 70. Which of the following does not describe global alignment algorithm?

In initialization step, the first row and first column are subject to gap penalty
Score can be negative
In trace back step, beginning is with the cell at the lower right of the matrix and it ends at top left cell
First row and first column are set to zero

Discuss Question

Answer: Option D. -> First row and first column are set to zero
Answer: (d).First row and first column are set to zero