Question: 1. Determine the most parsimonious tree, based on the matrix below. The letter O refers to the outgroup node. char. m n O P

 1. Determine the most parsimonious tree, based on the matrix below. The  

1. Determine the most parsimonious tree, based on the matrix below. The letter "O" refers to the outgroup node. char. m n O P r S t A B 1 1 r 0 u 1 1 0 1 0 0 1 1 0 0 0 1 1 0 1 C 1 0 1 1 1 0 0 0 1 species D 1 0 0 E 0 0 1 0 0 0 0 0 1 0 0 0 1 F 0 0 0 0 1 0 1 1 1 0 1 G 0 0 0 0 0 0 O 0 0 0 0 1 0 0 0 1 0 0 0 2. Calculate CI, RI, and RC for the tree in question 1. Also, list all sister group pairs. 3. Label all the nodes except the root node for the tree in question 1, and indicate all independent contrasts.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

To determine the most parsimonious tree based on the given matrix I assume that the matrix represent... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!