1.

It can be computationally very demanding to find a true phylogenetic tree when the number of sequences is large.(a) True(b) FalseThis question was addressed to me by my school teacher while I was bunking the class.Asked question is from Forms of Tree Representation in portion Molecular Phylogenetics of Bioinformatics

Answer»

Right answer is (a) True

Best EXPLANATION: Because the number of rooted topologies is much larger than that for unrooted ONES, the search for a true phylogenetic tree can be simplified by calculating the unrooted trees first. Once an optimal tree is FOUND, rooting the tree can be performed by designating a number of taxa in the DATA set as an OUTGROUP based on external information to produce a rooted tree.



Discussion

No Comment Found

Related InterviewSolutions