Question 108 NAT · 1.0 marks
A published solution is not available for this question yet.
Algorithmic Thinking in Bioinformatics · Quiz 1 · May 2024
Algorithmic Thinking in Bioinformatics · Quiz 1 · 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 / 17 published solutions
Question 109 NAT · 1.0 marks
A published solution is not available for this question yet.
Question 111 NAT · 3.0 marks
Scientists found an alien world where life follows the same central dogma principle. Their DNA
consists of 5 different types of nucleotides (and so is their RNA) and amino acids are generated
using codons of length 4. Also, due to some chemical structure of the nucleotides, any nucleotide
can occur exactly once in a codon. Calculate the maximum number of unique amino acids that be
generated.
Enter the value as a single integer.
A published solution is not available for this question yet.
Question 112 NAT · 3.0 marks
A published solution is not available for this question yet.
Question 113 NAT · 3.0 marks
A published solution is not available for this question yet.
Question 114 MCQ · 3.0 marks
The figure below shows the genetic code describing the translation of an RNA codon into one of
the twenty different amino acids. Use the figure below to answer the given subquestions.
Source: https://www.needpix.com/photo/93401/dna-amino-acids-biology-code-genetics-
molecular-science
Find the translation of the following RNA string into an amino acid string.
TDTGL
TDTGF
TETGF
TETGL
A published solution is not available for this question yet.
Question 115 NAT · 3.0 marks
The figure below shows the genetic code describing the translation of an RNA codon into one of
the twenty different amino acids. Use the figure below to answer the given subquestions.
Source: https://www.needpix.com/photo/93401/dna-amino-acids-biology-code-genetics-
molecular-science
If the amino acid “Leucine (L)” is generated, then what is the probability that the codon
encountered starts with “Uracil (U)”? Assume that the different positions of the codon are set to a
nucleotide independently and uniformly at random.
Round your answer to two decimal digits.
A published solution is not available for this question yet.
Question 116 NAT · 3.0 marks
A receptor R receives information about a pathogen and transmits the information to gene G via
the following edges.
• R to Y1 with edge probability 0.02.
• Y1 to Y2 with edge probability 0.03.
• Y2 to Y3 with edge probability 0.06.
• Y3 to G with edge probability 0.01.
Based on the above data, answer the given subquestions.
A published solution is not available for this question yet.
Question 117 NAT · 3.0 marks
A receptor R receives information about a pathogen and transmits the information to gene G via
the following edges.
• R to Y1 with edge probability 0.02.
• Y1 to Y2 with edge probability 0.03.
• Y2 to Y3 with edge probability 0.06.
• Y3 to G with edge probability 0.01.
Based on the above data, answer the given subquestions.
In a random coloring of the nodes of the underlying GRN network using 6 colors, what is the
probability that this path is colorful? (Random coloring refers to coloring each node in the graph
with one of the 6 colors uniformly and independently at random.)
Round up the answer to 2 decimal points.
A published solution is not available for this question yet.
Question 118 MCQ · 4.0 marks
Yes, predicted to bind
No, not predicted to bind
A published solution is not available for this question yet.
Question 119 MCQ · 4.0 marks
A published solution is not available for this question yet.
Question 120 MCQ · 3.0 marks
In signaling pathway detection using the color coding algorithm, increasing the number of colors
increases the probability of detecting the best scoring path, as well as the running time of each
coloring run.
TRUE
FALSE
A published solution is not available for this question yet.
Question 121 NAT · 4.0 marks
The following reads are found from a genome sequence of some organism.
ATG,CAT, TAG,GAT, TTA,AAT,ATA, AGA, ATC, TGC,GCA
As a biologist, you have to assemble the sequence of the genome from these reads for your
project. Answer the given subquestions with respect to the same. Recall that the Hamiltonian path
approach is used in an overlap graph and the Eulerian path approach is used in the de Bruijn
graph for the genome assembly problem.
How many nodes are there in the corresponding de Bruijn graph?
Enter the value as a single integer.
A published solution is not available for this question yet.
Question 122 MCQ · 3.0 marks
The following reads are found from a genome sequence of some organism.
ATG,CAT, TAG,GAT, TTA,AAT,ATA, AGA, ATC, TGC,GCA
As a biologist, you have to assemble the sequence of the genome from these reads for your
project. Answer the given subquestions with respect to the same. Recall that the Hamiltonian path
approach is used in an overlap graph and the Eulerian path approach is used in the de Bruijn
graph for the genome assembly problem.
Which among the following statements is/are true?
The underlying genome can be constructed using both overlap and de Bruijn
graphs.
The underlying genome can be constructed using overlap graph but not with
de Bruijn graph.
The underlying genome can be constructed using de Bruijn graph but not with
overlap graph.
The underlying genome cannot be constructed as certain reads are either
missing or erroneous.
A published solution is not available for this question yet.
Question 123 NAT · 4.0 marks
Based on the above data, answer the given subquestions.
A published solution is not available for this question yet.
Question 124 MCQ · 4.0 marks
Based on the above data, answer the given subquestions.
Consider the global alignment between v and w. Let the score be computed as follows:
From the given options identify the highest-scoring global alignment(s) between the two strings.
A published solution is not available for this question yet.
Question 125 MSQ · 3.0 marks
Which among the following statements is/are correct?
Global alignment involves aligning the entire sequences, while local alignment
involves aligning smaller parts/substrings of the sequence.
Alignment problem can be solved using a greedy algorithm approach.
To compute the global alignment between two sequences, free rides (zero
weight edges) are added from the source (0, 0) to every node and from every node to the sink (n,
m) in the alignment graph.
The alignment problem can be solved in linear space.
**Industry 4.0**
**Section Id :** 64065359431
**Section Number :** 8
**Section type :** Online
**Mandatory or Optional :** Mandatory
**Number of Questions :** 13
A published solution is not available for this question yet.