Questions and published explanations below are available without starting a test. Some questions may not have a published solution yet.
0 / 17 published solutions
Question 2 MCQ · 2.0 marks
An additive distance matrix
, defined for
species, requires
space when stored as a full
distance matrix. We apply the additive phylogeny algorithm on
to construct a simple
phylogenetic tree
with
leaves and at most
branching points (internal nodes), and store
it to a file. Assume that every value stored in both the files including the names of the leaves are
integers, and requires same amount of storage space. Answer the given subquestions with
respect to the same.
What is the asymptotic space complexity required to store the **topology** of the phylogenetic tree?
space when stored as a full
distance matrix. We apply the additive phylogeny algorithm on
to construct a simple
phylogenetic tree
with
leaves and at most
branching points (internal nodes), and store
it to a file. Assume that every value stored in both the files including the names of the leaves are
integers, and requires same amount of storage space. Answer the given subquestions with
respect to the same.
What is the asymptotic space complexity required to store the **branch lengths** of the phylogenetic
tree?
space when stored as a full
distance matrix. We apply the additive phylogeny algorithm on
to construct a simple
phylogenetic tree
with
leaves and at most
branching points (internal nodes), and store
it to a file. Assume that every value stored in both the files including the names of the leaves are
integers, and requires same amount of storage space. Answer the given subquestions with
respect to the same.
What is the asymptotic time complexity required to retrieve the distance between two leaves
space when stored as a full
distance matrix. We apply the additive phylogeny algorithm on
to construct a simple
phylogenetic tree
with
leaves and at most
branching points (internal nodes), and store
it to a file. Assume that every value stored in both the files including the names of the leaves are
integers, and requires same amount of storage space. Answer the given subquestions with
respect to the same.
Suppose the distance matrix
is not available, and only the files containing information on the
phylogenetic tree are accessible. Then, what is the asymptotic time complexity required to retrieve
the distance between two leaves
This profile matrix was computed from a set of five motifs as shown below. Three nucleotides in
the motif set are missing. Use the given profile matrix above to infer the missing nucleotides and
answer the given subquestions with respect to the same.
What is the nucleotide at position (i) in the given set of motifs?
6406537125631.
A
6406537125632.
C
6406537125633.
G
6406537125634.
T
A published solution is not available for this question yet.
This profile matrix was computed from a set of five motifs as shown below. Three nucleotides in
the motif set are missing. Use the given profile matrix above to infer the missing nucleotides and
answer the given subquestions with respect to the same.
Determine the nucleotide/s at positions (ii) and (iii).
6406537125635.
A
6406537125636.
C
6406537125637.
G
6406537125638.
T
A published solution is not available for this question yet.
You join a job that involves working on sample reads for disease
. The figure given below
represents the suffix trie of the reference human genome (for a healthy person).
Answer the given subquestions with respect to the same.
In this simplified model, assume a person
does not have the disease
(i.e.,
is healthy) if the
sample read collected (from
) does not have any mutation. The options given below are the
reads collected from different individuals. Determine which among these individuals is/are
healthy?
6406537125655.
TTAC
6406537125656.
GTCA
6406537125657.
ATGT
6406537125658.
GGCC
A published solution is not available for this question yet.
The GC-content distribution of a bacterial metagenome is modelled as a two-component Gaussian
Mixture Model, where each component corresponds to a distinct taxonomic bin:
• Component 1: Mean
, Variance
, Weight
• Component 2: Mean
, Variance
, Weight
Given a contig with normalized GC score
, calculate the responsibilities (posterior
probabilities) for each component. Hint:
6406537125675.
,
6406537125676.
,
6406537125677.
,
6406537125678.
,
A published solution is not available for this question yet.
