In a directed protein-protein interaction network, the researchers want to identify protein clusters
that interact densely with each other but have sparse connections to other proteins in the
network. Which method would be the most effective in discovering these hubs?
6406532563755.
Using betweenness centrality.
6406532563756.
Using the degree distribution.
6406532563757.
Using Girvan-Newman algorithm.
6406532563758.
Finding nodes with high in-degree but low out-degree.
A published solution is not available for this question yet.
Investigator X is tasked with identifying the spread of a virus in a city. The team has narrowed
down the origin of the spread to 4 locations and obtained the contact tracing information for 4
suspected individuals. The social contact network is represented as a bipartite graph. Answer the
following questions based on the provided network.
Find the projection of the location contact network at 11:00. Note: No transition time is considered
for traveling between locations.
Given the two sequences “AGAGCTTA”, “AAGAGTTGA”, and the scoring paradigm: matches: “+2”,
mismatches: “-3” and gap: “-1”, find the final score for the best global alignment between the two
sequences.
6406532563731.
10
6406532563732.
11
6406532563733.
2
6406532563734.
8
A published solution is not available for this question yet.
Given the k-mers : ’GCCGT’, ’CGTAG’, ’TAGGC’, ’GTAGG’, ’CTATG’, ’CCGTA’, ’TATGC’, ’TGCCG’, ’AGGCG’,
’ATGCC’, reconstruct the sequence from which the k-mers were generated.
6406532563735.
CTATACCGTAGGCG
6406532563736.
CTATGCCGTAGGCG
6406532563737.
ATCGGTACAACGG
6406532563738.
TATGCCGTAGGCGC
A published solution is not available for this question yet.
We have a graph that was constructed by comparing n DNA sequences. If the two sequences can
be aligned with a score greater than a threshold value, we assign an edge between the two in the
graph. Given this, which of the following is true:
6406532563739.
Inserting a new node to the graph requires n comparisons
6406532563740.
Inserting a new node is a node level task
6406532563741.
If all the alignments have the same score, the resultant graph is a complete
graph
6406532563742.
There will be two connected components in the resultant graph
A published solution is not available for this question yet.
Consider the following two statements:
Statement 1: Reads from the genome sequencing are prone to error.
Statement 2: Sequence alignment can be used to overcome this problem.
Based on your observations, which of the following statements is not true?
6406532563751.
Both statements are true and statement 2 is a potential solution for statement
1
6406532563752.
Both statements are true but statement 2 is not a solution to statement 1
6406532563753.
Both statements are false
6406532563754.
Statement 1 is false but Statement 2 is true
A published solution is not available for this question yet.
**SW Engg**
**Section Id :** 64065353055
**Section Number :** 2
**Section type :** Online
**Mandatory or Optional :** Mandatory
**Number of Questions :** 22
A published solution is not available for this question yet.