Biology Stack Exchange is a question and answer site for biology researchers, academics, and students. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I don't understand how to sum the changes in a phylogenetic tree.

Here for example:

How do you end up with 8 for the first and 9 for the second ?

share|improve this question
up vote 2 down vote accepted

It seems to me that they are not summing the changes correctly in this page.

They are summing the lengths of the paths to the root (and for the fig 2, they assume that the terminal branches, from left to right are of lengths 3, 2, 1 and 1). This doesn't make sense to me.

The correct way to count changes using parsimony is to consider each site in the alignment, and try to put the minimum number of mutations on the tree to explain the states observed at the terminal branches. Then, sum the number of mutations across alignment sites.

Here, for figure 1, I get:

site 1: 1 mutation, either on the left (T->A) or on the right (A->T) internal branch.

site 2: 1 mutation on the 4th terminal branch (T->C)

site 3: 0 mutations (all terminals have C)

site 4: 1 mutation on the 2nd terminal branch (G->C)

Total: 3

for figure 2:

site 1: 1 mutation on the branch leading to the most recent common ancestor of the two right-most terminals (A->T)

site 2: 1 mutation on the right-most terminal branch (T->C)

site 3: 0 mutations (same reason as for figure 1)

site 4: 1 mutation, either on the left-most branch (G->C) or on the branch leading to the most recent common ancestor of the 3 right-most terminals (C->G)

Total: 3

The trees are equi-parsimonious.

I hope I did not make any mistakes.

There exist algorithms to do this. For instance, Wagner parsimony.

Don't trust a course on phylogeny that resides on a medical center web page.

share|improve this answer
Ok, thanks for your time – mwa1 Jan 7 '13 at 20:55

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.