Question 13
We have a graph constructed by comparing n DNA sequences. If the two sequences can be aligned with a final score greater than a threshold, there exists an edge between the two in the graph. Given this, which of the following is true?
Inserting a new node to the graph requires n comparisons
Inserting a new node is a node level task
If all the alignments have the same score, the resultant graph is a completegraph
There will be two connected components in the resultant graph