TLS Online TPP Program
More Questions
TLS Online TPP Program
#Question id: 14116
#SCPH01 Biochemistry
Which of the following statements are CORRECT when a protein sequence database is searched using the BLAST algorithm?
P. A larger E-value indicates higher sequence similarity
Q. E-value < 10^-10 indicates sequence homology
R. A higher BLAST score indicates higher sequence similarity
S. E-value > 10^10 indicates sequence homology
TLS Online TPP Program
#Question id: 14116
#I Life Science/ Life Sciences Group – I-V
Which of the following statements are CORRECT when a protein sequence database is searched using the BLAST algorithm?
P. A larger E-value indicates higher sequence similarity
Q. E-value < 10^-10 indicates sequence homology
R. A higher BLAST score indicates higher sequence similarity
S. E-value > 10^10 indicates sequence homology
TLS Online TPP Program
#Question id: 14116
#SCPH05 I Biotechnology
Which of the following statements are CORRECT when a protein sequence database is searched using the BLAST algorithm?
P. A larger E-value indicates higher sequence similarity
Q. E-value < 10^-10 indicates sequence homology
R. A higher BLAST score indicates higher sequence similarity
S. E-value > 10^10 indicates sequence homology
TLS Online TPP Program
#Question id: 14116
#SCPH05 I Biotechnology
Which of the following statements are CORRECT when a protein sequence database is searched using the BLAST algorithm?
P. A larger E-value indicates higher sequence similarity
Q. E-value < 10^-10 indicates sequence homology
R. A higher BLAST score indicates higher sequence similarity
S. E-value > 10^10 indicates sequence homology
TLS Online TPP Program
#Question id: 14117
#SCPH01 Biochemistry
Identify the character based method used for the construction of a phylogenetic tree.
P. Maximum parsimony
Q. Neighbor joining
R. Maximum likelihood
S. Bootstrapping
TLS Online TPP Program
#Question id: 14117
#I Life Science/ Life Sciences Group – I-V
Identify the character based method used for the construction of a phylogenetic tree.
P. Maximum parsimony
Q. Neighbor joining
R. Maximum likelihood
S. Bootstrapping