MO640 - Exercises - Phylogenetic trees: Parsimony, Felsenstein (2004) - chapter 1

Exercises marked with (*) require further reading/search beyond the suggested texts.

2. Find a tree that minimizes the total number of changes for the matrix spieces vs. characters below.

C1 C2 C3 C4 C5
A 1 1 1 1 0
B 1 0 0 0 1
C 0 1 0 1 1

Answer:

Each number i in the figure below represents a change in character Ci. Bold rectangles signal 0 → 1 changes, while hollow rectangles signal 1 → 0 changes. The minimum number of changes is 5, since there are 5 multi-state characters.

best tree


MO640 Home

© 2015 Joao Meidanis