Question 147 MCQ · 3.0 marks
Fill the given blanks to complete the Neighbor-Joining algorithm.
A published solution is not available for this question yet.
Algorithmic Thinking in Bioinformatics · Quiz 2 · May 2024
Algorithmic Thinking in Bioinformatics · Quiz 2 · May 2024
← Course papers · Start practice / exam
Questions and published explanations below are available without starting a test. Some questions may not have a published solution yet.
0 / 15 published solutions
Question 148 MCQ · 3.0 marks
A published solution is not available for this question yet.
Question 149 MCQ · 3.0 marks
A published solution is not available for this question yet.
Question 150 MSQ · 4.0 marks
You enter an alien world as a renowned computational biologist. The table below is presented to
you as part of a preliminary study done by a group of scientists to study the local fauna around the
base camp. They have analyzed the DNA and figured out that there are only two bases “+” and “0”.
The table below represents the DNA sequence in 6 positions for the different species found.
Based on the above data, answer the given subquestions.
The scientists have tried to construct the distance matrix as follows:
A published solution is not available for this question yet.
Question 151 NAT · 3.0 marks
You enter an alien world as a renowned computational biologist. The table below is presented to
you as part of a preliminary study done by a group of scientists to study the local fauna around the
base camp. They have analyzed the DNA and figured out that there are only two bases “+” and “0”.
The table below represents the DNA sequence in 6 positions for the different species found.
Based on the above data, answer the given subquestions.
A published solution is not available for this question yet.
Question 152 MSQ · 4.0 marks
You enter an alien world as a renowned computational biologist. The table below is presented to
you as part of a preliminary study done by a group of scientists to study the local fauna around the
base camp. They have analyzed the DNA and figured out that there are only two bases “+” and “0”.
The table below represents the DNA sequence in 6 positions for the different species found.
Based on the above data, answer the given subquestions.
The scientists have constructed the following phylogeny using the “Additive Phylogeny” algorithm.
The algorithm chose the leaf A in the first iteration, the leaf B in the second iteration, and the leaf C
in the third iteration.
Which among the following is/are correct about the weights of the edges in the phylogeny?
Weight of the edge between H and F is 1
Weight of the edge between H and G is 2
Weight of the edge between A and H is 1
Weight of the edge between H and F is 2
Weight of the edge between H and G is 1
A published solution is not available for this question yet.
Question 153 NAT · 3.0 marks
You are asked to construct the suffix tree of an alien DNA sequence. If the alien DNA is composed
of 6 different types of nucleotides, then what is the maximum number of children a node can have
in the tree? Assume the symbol $ is appended at the end of the sequence.
A published solution is not available for this question yet.
Question 154 NAT · 3.0 marks
If a genome sequence Text of length 100 takes 400 Bytes of memory space, then how many Bytes
of memory space is required to store the Burrows-Wheeler transform of Text?
Enter the value as a single integer.
A published solution is not available for this question yet.
Question 155 MSQ · 4.0 marks
You join a job that involves working on sample reads for disease X. The figure given below
represents the suffix trie of the reference human genome (for a healthy person).
Based on the above data, answer the given subquestions.
We say a person S does not have the disease X (i.e., S is healthy) if the sample read collected (from
S) does not have any mutation. The options given below are the reads collected from different
individuals. Match the reads with the suffix trie to identify which among these individuals is/are
healthy?
CCGGG
CCGGT
CTAAC
TCAAC
ATCCG
A published solution is not available for this question yet.
Question 156 MCQ · 3.0 marks
You join a job that involves working on sample reads for disease X. The figure given below
represents the suffix trie of the reference human genome (for a healthy person).
Based on the above data, answer the given subquestions.
Use the suffix trie given to determine, which among the following is the reference human genome
for a healthy person?
TTGTCCCCCGGGT$
TTGTCAACTGGGT$
ATGTCAACCGGGT$
ATGTCAACCGGGG$
TTTGCAACCGGGT$
A published solution is not available for this question yet.
Question 157 NAT · 3.0 marks
Based on the above data, answer the given subquestions.
A published solution is not available for this question yet.
Question 158 MCQ · 3.0 marks
Based on the above data, answer the given subquestions.
Find the consensus of the motifs?
CAGAAT
CGGAAT
TAGAGG
GAGAAT
GGGACT
A published solution is not available for this question yet.
Question 159 MCQ · 4.0 marks
Based on the above data, answer the given subquestions.
Use the profile matrix to determine which of the following k-mers have the highest probability?
ACAGGA
GAGACT
AGGACT
ACGGAA
GGGAAA
A published solution is not available for this question yet.
Question 160 MCQ · 4.0 marks
Consider the following hard K-means clustering problem with five points: A (1, 2), B (2, 3), C (6, 7),
D (8, 8), and E (7, 6). Consider the number of clusters to be K = 2 and the initial centroids to be C1 =
(0, 0) and C2 = (7, 7). After how many iterations will the algorithm terminate and what will be the
final centroids?
2, (1.5, 2.5), (7, 7)
3, (1.5, 2.5), (7, 7)
2, (1.5, 2.5), (7.5, 7)
3, (2, 3), (7, 7)
A published solution is not available for this question yet.
Question 161 MSQ · 3.0 marks
Which of the following is/are True?
K-means algorithm requires the initial centroids to be chosen randomly.
K-means algorithm may not find the globally optimal solution.
The complexity of the K-means algorithm is polynomial with respect to the
number of data points and clusters.
K-means algorithm can be used for clustering data points in higher-
dimensional spaces.
**Industry 4.0**
**Section Id :** 64065361115
**Section Number :** 9
**Section type :** Online
**Mandatory or Optional :** Mandatory
**Number of Questions :** 8
**Number of Questions to be attempted :** 8
**Section Marks :** 20
**Display Number Panel :** Yes
**Section Negative Marks :** 0
**Group All Questions :** No
**Enable Mark as Answered Mark for Review and**
No
**Clear Response :**
**Section Maximum Duration :** 0
**Section Minimum Duration :** 0
**Section Time In :** Minutes
**Maximum Instruction Time :** 0
A published solution is not available for this question yet.