Question 132 MCQ · 3.0 marks
0.28
0.094
0.007
0.55
A published solution is not available for this question yet.
Algorithmic Thinking in Bioinformatics · End Term · Jan 2023 · AN
Algorithmic Thinking in Bioinformatics · End Term · Jan 2023 AN
← Course papers · Start practice / exam
This page contains the reliably extracted subset, not the complete original paper.
Questions and published explanations below are available without starting a test. Some questions may not have a published solution yet.
0 / 16 published solutions
Question 133 MCQ · 3.0 marks
3
2
4
8
A published solution is not available for this question yet.
Question 134 MCQ · 3.0 marks
The DNA-binding domain (region or substring) of a Protein ”P” is found to be homologous (same
function) in Organisms 1 and 2. Which among the following would you suggest to compare them?
Local alignment
Global alignment
Both Local alignment and Global alignment
None of these
A published solution is not available for this question yet.
Question 135 MCQ · 3.0 marks
Consider the following hypothetical phylogenetic tree constructed using viral sequences isolated
from different host species.
Which of the following is/are true (with absolute certainty) with respect to the immediate common
ancestor of the Human and Chicken viruses?
Human virus is the immediate common ancestor
Chicken virus is the immediate common ancestor
Pig virus is the immediate common ancestor
Cannot tell
A published solution is not available for this question yet.
Question 136 MCQ · 3.0 marks
Which of the following is/are not true with respect to additive and ultrametric distance matrices
and trees? Assume that the distance matrix satisfies the usual distance metric axioms like non-
negativity, symmetricity and triangle inequality. Also, recall that an ultrametric distance matrix is
any distance matrix that can be derived from some ultrametric tree (using the edge weights and
paths in that tree).
A 3 × 3 non-additive distance matrix is possible.
A 4 × 4 non-additive distance matrix is possible.
All ultrametric distance matrices are additive but not vice-versa.
In an ultrametric tree, the distance from the root to any leaf is the same.
A published solution is not available for this question yet.
Question 137 MCQ · 3.0 marks
Only 2
2 and 3
1 and 3
Only 3
A published solution is not available for this question yet.
Question 138 MCQ · 3.0 marks
A published solution is not available for this question yet.
Question 139 MCQ · 4.0 marks
A published solution is not available for this question yet.
Question 140 MCQ · 4.0 marks
A published solution is not available for this question yet.
Question 141 MSQ · 2.0 marks
Which of the following is/are are True about **hard K-means clustering** algorithm?
Sensitivity to outliers
Sensitivity to centroid initialization
Non-convergence
Some of the output clusters can be non-convex.
A published solution is not available for this question yet.
Question 142 MSQ · 3.0 marks
Which of the following is/are example(s) of poor Hard clustering?
A published solution is not available for this question yet.
Question 143 MSQ · 3.0 marks
Randomness is used to make decisions in which steps of the Gibbs sampling-based algorithm for
motif-finding?
Initial choice of motifs.
Calculations of the probability of k-mers using Profile matrix.
Choosing the sequence to ignore for the current iteration.
Choosing the k-mer for the ignored sequence.
A published solution is not available for this question yet.
Question 144 MCQ · 3.0 marks
Based on the above data, answer the given subquestions.
A published solution is not available for this question yet.
Question 145 MCQ · 3.0 marks
Based on the above data, answer the given subquestions.
A published solution is not available for this question yet.
Question 146 MSQ · 5.0 marks
A published solution is not available for this question yet.
Question 147 MCQ · 2.0 marks
**BBN**
**Section Id :** 64065338435
**Section Number :** 8
**Section type :** Online
**Mandatory or Optional :** Mandatory
**Number of Questions :** 47
**Number of Questions to be attempted :** 47
**Section Marks :** 100
**Display Number Panel :** Yes
**Group All Questions :** No
**Enable Mark as Answered Mark for Review and**
Yes
**Clear Response :**
**Maximum Instruction Time :** 0
A published solution is not available for this question yet.