The algorithm for BLAST is based on

1.	The algorithm for BLAST is based on
A.	Dynamic Programming
B.	Hidden Markov Model
C.	k-tuple analysis
D.	Neural Network
Answer» D. Neural Network

Discussion

No Comment Found

Related MCQs

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
Consider the following multiple sequence alignment of four DNA sequences. A C T A A C T G A G T C A G C T Shannon's entropy of the above alignment is __
Identify the file format given below: >Pl; JMFD Protein X Homo sapiens MKALTARQQEVFDLIRDHISRTLRQQGDWL
Determine the correctness or otherwise of the following Assertion (A) and Reason (R).Assertion: UPGMA method produces ultrametric tree. Reason:Sequence alignment is converted into evolutionary distances in UPGMA method.
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
Match the methods available on world wide web in group 1 for performing the jobs listed in group 2 Group 1Group 2P. Boxshade1. Searching family data baseQ. BCM launcher2. Finding alignmentsR. Prosite3. Displaying alignmentsS. PSI-BLAST4. Searching for multiple alignments
Match the item in Group I with an appropriate description in Group 2 : Group 1Group 2P. UPGMA1. Protein sequence databaseQ. CLUSTAL2. Phylogenetic analysisR. SWISS-PROT3. 3-D structure visualizationS. RasMOl4. Multiple sequence alignment
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

The algorithm for BLAST is based on

Discussion

No Comment Found

Related MCQs

Reply to Comment