For prediction of three dimensional structure of protein (P) homology modeling tries many possible alignments (Q) threading first identifies homologues (R) threading evaluates many rough models (S) homology modeling optimizes one model

For prediction of three dimensional structure of protein (P) homology

1.	For prediction of three dimensional structure of protein (P) homology modeling tries many possible alignments (Q) threading first identifies homologues (R) threading evaluates many rough models (S) homology modeling optimizes one model
A.	Q, S
B.	P, Q
C.	R, S
D.	Q, R
Answer» D. Q, R

Discussion

No Comment Found

Related MCQs

Match the entries in the Group Iwith the entries inGroup II. <br><table><tr><th>Group I</th><th>Group II</th></tr><tr><td>P. Threading</td><td>1. Gene duplication</td></tr><tr><td>Q. FASTA</td><td>2. Fold prediction</td></tr><tr><td>R. Profile</td><td>3. HMM</td></tr><tr><td>S. Paralogs</td><td>4. k-tuple</td></tr></table>
Consider the following multiple sequence alignment of four DNA sequences. <br>A C T A <br>A C T G <br>A G T C <br>A G C T <br>Shannon's entropy of the above alignment is __
Identify the file format given below: <br>>Pl; JMFD <br>Protein X Homo sapiens <br>MKALTARQQEVFDLIRDHISRTLRQQGDWL
Determine the correctness or otherwise of the following Assertion (A) and Reason (R).<br>Assertion: UPGMA method produces ultrametric tree. <br>Reason:Sequence alignment is converted into evolutionary distances in UPGMA method.
For prediction of three dimensional structure of protein <br>(P) homology modeling tries many possible alignments <br>(Q) threading first identifies homologues <br>(R) threading evaluates many rough models <br>(S) homology modeling optimizes one model
Match the methods available on world wide web in group 1 for performing the jobs listed in group 2 <br><table><tr><th>Group 1</th><th>Group 2</th></tr><tr><td>P. Boxshade</td><td>1. Searching family data base</td></tr><tr><td>Q. BCM launcher</td><td>2. Finding alignments</td></tr><tr><td>R. Prosite</td><td>3. Displaying alignments</td></tr><tr><td>S. PSI-BLAST</td><td>4. Searching for multiple alignments</td></tr></table>
Match the item in Group I with an appropriate description in Group 2 : <br><table><tr><th>Group 1</th><th>Group 2</th></tr><tr><td>P. UPGMA</td><td>1. Protein sequence database</td></tr><tr><td>Q. CLUSTAL</td><td>2. Phylogenetic analysis</td></tr><tr><td>R. SWISS-PROT</td><td>3. 3-D structure visualization</td></tr><tr><td>S. RasMOl</td><td>4. Multiple sequence alignment</td></tr></table>
The algorithm for BLAST is based on
How many rooted and unrooted phylogenetic trees, respectively, are possible with four different sequences ?
An example of a derived protein structure database is

For prediction of three dimensional structure of protein (P) homology modeling tries many possible alignments (Q) threading first identifies homologues (R) threading evaluates many rough models (S) homology modeling optimizes one model

Discussion

No Comment Found

Related MCQs

Reply to Comment

For prediction of three dimensional structure of protein
(P) homology modeling tries many possible alignments
(Q) threading first identifies homologues
(R) threading evaluates many rough models
(S) homology modeling optimizes one model