Match the entries in the Group Iwith the entries inGroup II. Group IGr

Match the entries in the Group Iwith the entries inGroup II.
Group I Group II
P. Threading 1. Gene duplication
Q. FASTA 2. Fold prediction
R. Profile 3. HMM
S. Paralogs 4. k-tuple

P-2, Q-1, R-3, S-4

P-2, Q-4, R-3, S-1

P-3, Q-4, R-2, S-1

P-1, Q-4, R-3, S-2

Answer» C. P-3, Q-4, R-2, S-1

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

Match the entries in the Group Iwith the entries inGroup II. Group IGroup IIP. Threading1. Gene duplicationQ. FASTA2. Fold predictionR. Profile3. HMMS. Paralogs4. k-tuple

Discussion

No Comment Found

Related MCQs

Reply to Comment

Match the entries in the Group Iwith the entries inGroup II.
Group I Group II
P. Threading 1. Gene duplication
Q. FASTA 2. Fold prediction
R. Profile 3. HMM
S. Paralogs 4. k-tuple