Resources
Four animal taxa (, , , and ) are evaluated for four characters under maximum parsimony. Characters and support the unrooted tree topology , whereas characters and support the alternative unrooted topology . A fifth informative character is added: Taxon has state , Taxon has state , Taxon has state , and Taxon has state . Determine: (1) the parsimony tree length (minimum number of steps required across all five characters) for topology versus topology , and (2) which topology is favored as the most parsimonious resolution.
Answer and steps
Final answer
(1) Tree length for steps, Tree length for steps; (2) Topology is favored by a margin of step.
Steps
Understanding Parsimony for Four Taxa
Under the principle of maximum parsimony, the preferred phylogenetic tree is the one that requires the minimum total number of evolutionary changes (steps) across all evaluated characters.
For four taxa (), a binary character is parsimony-informative when two taxa share one state and the other two taxa share an alternative state (a split). For such a character:
- On the unrooted topology where the two pairs each share an internal node, only step (a single evolutionary change along the internal branch) is required.
- On any conflicting topology, the character cannot be explained by a single change and requires at least steps (homoplasy, via convergent evolution or reversal).
Evaluating Character Steps for Each Topology
The two candidate unrooted topologies are:
Characters and
Both characters support :
- Steps on : step each steps.
- Steps on : steps each steps.
Characters and
Both characters support :
- Steps on : steps each steps.
- Steps on : step each steps.
Character
Character has states:
- This character unites and with derived state , and and with state . This directly corresponds to the split .
- Therefore, supports topology :
- Steps on : step (one transition between state and state along the internal branch separating from ).
- Steps on : steps (because is paired with and is paired with , requiring at least two independent state transitions).
Calculating Total Tree Lengths
Sum the required steps across all five characters:
- Tree length for :
- Tree length for :
Conclusion and Selection of Optimal Topology
- Comparing the two topologies, requires steps while requires steps.
- Because maximum parsimony favors the topology with the minimum total tree length, topology is favored by a margin of step.
Typical errors
01 The student miscounts the steps required by non-supporting characters as zero steps instead of two steps on unrooted four-taxon trees.
Sample Student Work
Reviewed by ACEpath TeacherStep-by-Step Review
Walk Through It with Your Teacher- Step 1
and support : step each on , steps on
Correctand require step each on and steps each on .
Because and vary among the four taxa with a state distribution, any tree where they do not align with the internal branch requires at least two independent evolutionary changes (homoplasy), not steps.
- Step 2
and support : steps on , step each on
Correctand require steps each on and step each on .
Similarly, characters and support with step, but they conflict with and therefore require steps on rather than steps.
- Step 3
has , and , , supporting with step on and steps on
Correctsupports requiring step on and steps on .
You correctly identified that the state split vs matches topology , requiring step on . However, mapping this character onto the conflicting topology requires steps, not .
- Step 4
steps ⟹ steps
Correctsteps ⟹ steps
Your summation method was mechanically correct, but the values were derived from assigning steps to non-supporting characters.
- Step 5
Topology is favored because it has the shorter tree length of steps compared to steps for .
CorrectTopology is favored because it requires steps compared to steps for .
Because the true tree lengths are steps for and steps for , maximum parsimony favors by step.
WHAT YOU DID WELL
Compliments from Your TeacherYou correctly identified which unrooted topology was supported by the state distribution of character .
You correctly recognized that a supporting binary informative character requires evolutionary change on that topology.
You correctly understood the parsimony criterion selects the tree with the smaller total tree length.
THE ERROR
Where Your ACEpath Teacher Spotted the Mistakenone
WHY IT HAPPENED
ACEpath Teacher's DiagnosisYou treated a character that conflicts with a candidate tree as contributing zero cost to that tree, confusing 'does not support the tree' with 'requires zero evolutionary changes'. A character with two distinct states across taxa must always require at least one evolutionary change on any tree; when it conflicts with a four-taxon split, it requires at least two changes (homoplasy).
REASONING PATH
Your ACEpath teacher’s suggested approach- Minimum cost of a variable character
A character that exhibits two different states across taxa cannot have a length of steps on any tree; steps only applies to completely invariant (constant) characters.
Always verify that every variable character contributes at least step to every tree evaluated.
- Binary informative split cost on 4-taxon trees
For four taxa and a character state split, the character requires exactly step on the matching topology and steps on either non-matching alternative topology.
Assign step to the topology sharing the split, and assign steps to any competing topology.
CORRECTED PATH
ACEpath Teacher's DemonstrationFor each binary informative character exhibiting a split among four taxa, assign step to the topology it supports and steps to the conflicting topology.
For and (supporting ): requires steps; requires steps.
For and (supporting ): requires steps; requires steps.
For (, supporting ): requires step; requires steps.
Sum across all five characters: steps; steps.
(1) Tree length for steps, Tree length for steps; (2) Topology is favored by a margin of step.
02 The student assumes characters C1 through C4 each require only 1 step on every topology regardless of compatibility.
Sample Student Work
Reviewed by ACEpath TeacherStep-by-Step Review
Walk Through It with Your Teacher- Step 1
Characters C1 to C4 each require 1 step on both topologies: 4 steps total
CorrectOn : and require step each, while and require steps each ( steps). On : and require steps each, while and require step each ( steps).
A parsimony-informative character on four taxa requires step on its supported topology, but it requires at least steps (convergent evolution or reversal) on any conflicting topology.
- Step 2
C5 groups (P, Q) together, requiring 1 step on T1 and 2 steps on T2
- Step 3
Length(T1) = 4 + 1 = 5 steps ⟹ Length(T2) = 4 + 2 = 6 steps
CorrectYour addition followed your earlier steps, but the total lengths were underestimated by steps each because through contribute steps to each tree, not .
- Step 4
Topology T1 is favored because it requires 5 steps compared to 6 steps for T2.
CorrectTopology is favored because it requires steps compared to steps for (a margin of step).
You chose the correct winning topology based on your values, though the true tree lengths are steps versus steps.
WHAT YOU DID WELL
Compliments from Your TeacherYou correctly analyzed the character states of and matched them to the split.
You recognized that a character incompatible with a topology requires an extra step (homoplasy).
You applied the maximum parsimony criterion to choose the topology with fewer total steps.
THE ERROR
Where Your ACEpath Teacher Spotted the MistakeYou treated characters through as taking the minimum possible single step across every candidate tree, overlooking that characters incompatible with a topology must incur homoplasy.
WHY IT HAPPENED
ACEpath Teacher's DiagnosisYou overlooked that a parsimony-informative character requires steps when mapped onto an unrooted tree topology that conflicts with its split.
REASONING PATH
Your ACEpath teacher’s suggested approach- Parsimony score of an informative character
For four taxa, a binary informative character ( state split) requires exactly evolutionary change on its compatible unrooted tree, but requires at least changes on an incompatible unrooted tree.
Always evaluate character step counts topology-by-topology: assign step when compatible and steps when incompatible.
CORRECTED PATH
ACEpath Teacher's DemonstrationFor : and are compatible ( step each), while and conflict ( steps each), yielding steps.
For : and conflict ( steps each), while and are compatible ( step each), yielding steps.
Add the steps required by : on , requires step; on , requires steps.
Compute total tree lengths: steps, steps.
(1) Tree length for steps, Tree length for steps; (2) Topology is favored by step.
Lock it in
On an unrooted four-taxon tree, how many evolutionary steps does a parsimony-informative binary character ( split) require on a topology it does NOT support?
It requires steps (homoplasy via convergence or reversal). Only the single topology that matches the split requires step.
Similar question
Four taxa () are evaluated across three binary characters. Character has states . Character has states . Character has states . Calculate the tree length of topology across all three characters.
Answer
Tree length = steps. Character matches the split and costs step. Character conflicts with the split and costs steps. Character is invariant across all taxa and costs steps. Total length = steps.
A dataset of four taxa () contains parsimony-informative characters with splits. Five characters support unrooted topology , three characters support , and two characters support . Determine the parsimony length of each topology and state which tree is optimal.
Answer
Length() = steps, Length() = steps, Length() = steps; is optimal. On , the supporting characters cost step each (), while the conflicting characters cost steps each (), giving . For : . For : .
Four taxa () have four binary characters: , , , and (states listed in taxon order ). For the two trees and , calculate their lengths and determine if parsimony can resolve the relationship between them.
Answer
Length() = steps, Length() = steps; parsimony resolves as optimal. costs on and on . costs on and on . is an autapomorphy (informative only for a single branch), costing step on both trees. is invariant, costing steps on both trees. Thus, Length() = steps, and Length() = steps.