Resources

Four animal taxa (PP, QQ, RR, and SS) are evaluated for four characters under maximum parsimony. Characters C1C_1 and C2C_2 support the unrooted tree topology T1=((P,Q),(R,S))T_1 = ((P, Q), (R, S)), whereas characters C3C_3 and C4C_4 support the alternative unrooted topology T2=((P,R),(Q,S))T_2 = ((P, R), (Q, S)). A fifth informative character C5C_5 is added: Taxon PP has state 11, Taxon QQ has state 11, Taxon RR has state 00, and Taxon SS has state 00. Determine: (1) the parsimony tree length (minimum number of steps required across all five characters) for topology T1T_1 versus topology T2T_2, and (2) which topology is favored as the most parsimonious resolution.

Answer and steps

Final answer

(1) Tree length for T1=7T_1 = 7 steps, Tree length for T2=8T_2 = 8 steps; (2) Topology T1=((P,Q),(R,S))T_1 = ((P, Q), (R, S)) is favored by a margin of 11 step.

Steps

01

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 (P,Q,R,SP, Q, R, S), a binary character is parsimony-informative when two taxa share one state and the other two taxa share an alternative state (a 2:22:2 split). For such a character:

  • On the unrooted topology where the two pairs each share an internal node, only 11 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 22 steps (homoplasy, via convergent evolution or reversal).

02

Evaluating Character Steps for Each Topology

The two candidate unrooted topologies are:

  • T1=((P,Q),(R,S))T_1 = ((P, Q), (R, S))
  • T2=((P,R),(Q,S))T_2 = ((P, R), (Q, S))

Characters C1C_1 and C2C_2

Both characters support T1T_1:

  • Steps on T1T_1: 11 step each →1+1=2\rightarrow 1 + 1 = 2 steps.
  • Steps on T2T_2: 22 steps each →2+2=4\rightarrow 2 + 2 = 4 steps.

Characters C3C_3 and C4C_4

Both characters support T2T_2:

  • Steps on T1T_1: 22 steps each →2+2=4\rightarrow 2 + 2 = 4 steps.
  • Steps on T2T_2: 11 step each →1+1=2\rightarrow 1 + 1 = 2 steps.

Character C5C_5

Character C5C_5 has states: P=1,Q=1,R=0,S=0P = 1, \quad Q = 1, \quad R = 0, \quad S = 0

  • This character unites PP and QQ with derived state 11, and RR and SS with state 00. This directly corresponds to the split ((P,Q),(R,S))((P, Q), (R, S)).
  • Therefore, C5C_5 supports topology T1T_1:
    • Steps on T1T_1: 11 step (one transition between state 00 and state 11 along the internal branch separating (P,Q)(P, Q) from (R,S)(R, S)).
    • Steps on T2T_2: 22 steps (because PP is paired with RR and QQ is paired with SS, requiring at least two independent state transitions).

03

Calculating Total Tree Lengths

Sum the required steps across all five characters:

  • Tree length for T1T_1: Length(T1)=1 (C1)+1 (C2)+2 (C3)+2 (C4)+1 (C5)=7 steps\text{Length}(T_1) = 1 \,(C_1) + 1 \,(C_2) + 2 \,(C_3) + 2 \,(C_4) + 1 \,(C_5) = 7 \text{ steps}
  • Tree length for T2T_2: Length(T2)=2 (C1)+2 (C2)+1 (C3)+1 (C4)+2 (C5)=8 steps\text{Length}(T_2) = 2 \,(C_1) + 2 \,(C_2) + 1 \,(C_3) + 1 \,(C_4) + 2 \,(C_5) = 8 \text{ steps}

04

Conclusion and Selection of Optimal Topology

  • Comparing the two topologies, T1T_1 requires 77 steps while T2T_2 requires 88 steps.
  • Because maximum parsimony favors the topology with the minimum total tree length, topology T1=((P,Q),(R,S))T_1 = ((P, Q), (R, S)) is favored by a margin of 11 step.

Typical errors

OverviewACEpath Teacher's Diagnosis

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 Teacher
Step-by-Step Review
Walk Through It with Your Teacher
Incorrect
  1. Step 1

    C1C_1 and C2C_2 support T1T_1: 11 step each on T1T_1, 00 steps on T2T_2

    Correct

    C1C_1 and C2C_2 require 11 step each on T1T_1 and 22 steps each on T2T_2.

    Because C1C_1 and C2C_2 vary among the four taxa with a 2:22:2 state distribution, any tree where they do not align with the internal branch requires at least two independent evolutionary changes (homoplasy), not 00 steps.

  2. Step 2

    C3C_3 and C4C_4 support T2T_2: 00 steps on T1T_1, 11 step each on T2T_2

    Correct

    C3C_3 and C4C_4 require 22 steps each on T1T_1 and 11 step each on T2T_2.

    Similarly, characters C3C_3 and C4C_4 support T2T_2 with 11 step, but they conflict with T1T_1 and therefore require 22 steps on T1T_1 rather than 00 steps.

  3. Step 3

    C5C_5 has P=1P=1, Q=1Q=1 and R=0R=0, S=0S=0, supporting T1T_1 with 11 step on T1T_1 and 00 steps on T2T_2

    Correct

    C5C_5 supports T1T_1 requiring 11 step on T1T_1 and 22 steps on T2T_2.

    You correctly identified that the state split (P,Q)(P, Q) vs (R,S)(R, S) matches topology T1T_1, requiring 11 step on T1T_1. However, mapping this character onto the conflicting topology T2T_2 requires 22 steps, not 00.

  4. Step 4

    Length(T1)=1+1+0+0+1=3\text{Length}(T_1) = 1 + 1 + 0 + 0 + 1 = 3 steps ⟹ Length(T2)=0+0+1+1+0=2\text{Length}(T_2) = 0 + 0 + 1 + 1 + 0 = 2 steps

    Correct

    Length(T1)=1+1+2+2+1=7\text{Length}(T_1) = 1 + 1 + 2 + 2 + 1 = 7 steps ⟹ Length(T2)=2+2+1+1+2=8\text{Length}(T_2) = 2 + 2 + 1 + 1 + 2 = 8 steps

    Your summation method was mechanically correct, but the values were derived from assigning 00 steps to non-supporting characters.

  5. Step 5

    Topology T2T_2 is favored because it has the shorter tree length of 22 steps compared to 33 steps for T1T_1.

    Correct

    Topology T1T_1 is favored because it requires 77 steps compared to 88 steps for T2T_2.

    Because the true tree lengths are 77 steps for T1T_1 and 88 steps for T2T_2, maximum parsimony favors T1T_1 by 11 step.

WHAT YOU DID WELL
Compliments from Your Teacher

You correctly identified which unrooted topology was supported by the state distribution of character C5C_5.

You correctly recognized that a supporting binary informative character requires 11 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 Mistake
Parsimony step miscount on conflicting topologies

none

WHY IT HAPPENED
ACEpath Teacher's Diagnosis

You 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 00 steps on any tree; 00 steps only applies to completely invariant (constant) characters.

  • Always verify that every variable character contributes at least 11 step to every tree evaluated.

Binary informative split cost on 4-taxon trees
  • For four taxa and a 2:22:2 character state split, the character requires exactly 11 step on the matching topology and 22 steps on either non-matching alternative topology.

  • Assign 11 step to the topology sharing the split, and assign 22 steps to any competing topology.

CORRECTED PATH
ACEpath Teacher's Demonstration
  1. For each binary informative character exhibiting a 2:22:2 split among four taxa, assign 11 step to the topology it supports and 22 steps to the conflicting topology.

  2. For C1C_1 and C2C_2 (supporting T1T_1): T1T_1 requires 1+1=21+1=2 steps; T2T_2 requires 2+2=42+2=4 steps.

  3. For C3C_3 and C4C_4 (supporting T2T_2): T1T_1 requires 2+2=42+2=4 steps; T2T_2 requires 1+1=21+1=2 steps.

  4. For C5C_5 (P=1,Q=1,R=0,S=0P=1, Q=1, R=0, S=0, supporting T1T_1): T1T_1 requires 11 step; T2T_2 requires 22 steps.

  5. Sum across all five characters: Length(T1)=1+1+2+2+1=7\text{Length}(T_1) = 1 + 1 + 2 + 2 + 1 = 7 steps; Length(T2)=2+2+1+1+2=8\text{Length}(T_2) = 2 + 2 + 1 + 1 + 2 = 8 steps.

Final answer

(1) Tree length for T1=7T_1 = 7 steps, Tree length for T2=8T_2 = 8 steps; (2) Topology T1=((P,Q),(R,S))T_1 = ((P, Q), (R, S)) is favored by a margin of 11 step.

NEXT STEPS
Final Takeaways from Your Teacher
  • Review the Fitch parsimony algorithm or character state mapping on unrooted four-taxon trees to see why homoplasy costs 22 steps.

  • Practice reconstructing tree lengths from character matrices by ensuring every informative character is explicitly mapped onto all candidate trees.

OverviewACEpath Teacher's Diagnosis

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 Teacher
Step-by-Step Review
Walk Through It with Your Teacher
Partially correct
  1. Step 1

    Characters C1 to C4 each require 1 step on both topologies: 4 steps total

    Correct

    On T1T_1: C1C_1 and C2C_2 require 11 step each, while C3C_3 and C4C_4 require 22 steps each (1+1+2+2=61+1+2+2 = 6 steps). On T2T_2: C1C_1 and C2C_2 require 22 steps each, while C3C_3 and C4C_4 require 11 step each (2+2+1+1=62+2+1+1 = 6 steps).

    A parsimony-informative character on four taxa requires 11 step on its supported topology, but it requires at least 22 steps (convergent evolution or reversal) on any conflicting topology.

  2. Step 2

    C5 groups (P, Q) together, requiring 1 step on T1 and 2 steps on T2

  3. Step 3

    Length(T1) = 4 + 1 = 5 steps ⟹ Length(T2) = 4 + 2 = 6 steps

    Correct

    Length(T1)=6+1=7 steps  ⟹  Length(T2)=6+2=8 steps\text{Length}(T_1) = 6 + 1 = 7\text{ steps} \implies \text{Length}(T_2) = 6 + 2 = 8\text{ steps}

    Your addition followed your earlier steps, but the total lengths were underestimated by 22 steps each because C1C_1 through C4C_4 contribute 66 steps to each tree, not 44.

  4. Step 4

    Topology T1 is favored because it requires 5 steps compared to 6 steps for T2.

    Correct

    Topology T1T_1 is favored because it requires 77 steps compared to 88 steps for T2T_2 (a margin of 11 step).

    You chose the correct winning topology based on your values, though the true tree lengths are 77 steps versus 88 steps.

WHAT YOU DID WELL
Compliments from Your Teacher

You correctly analyzed the character states of C5C_5 and matched them to the ((P,Q),(R,S))((P, Q), (R, S)) 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 Mistake
Miscounting homoplasy steps on incompatible topologies

You treated characters C1C_1 through C4C_4 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 Diagnosis

You overlooked that a parsimony-informative character requires 22 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 (2:22:2 state split) requires exactly 11 evolutionary change on its compatible unrooted tree, but requires at least 22 changes on an incompatible unrooted tree.

  • Always evaluate character step counts topology-by-topology: assign 11 step when compatible and 22 steps when incompatible.

CORRECTED PATH
ACEpath Teacher's Demonstration
  1. For T1=((P,Q),(R,S))T_1 = ((P, Q), (R, S)): C1C_1 and C2C_2 are compatible (11 step each), while C3C_3 and C4C_4 conflict (22 steps each), yielding 1+1+2+2=61 + 1 + 2 + 2 = 6 steps.

  2. For T2=((P,R),(Q,S))T_2 = ((P, R), (Q, S)): C1C_1 and C2C_2 conflict (22 steps each), while C3C_3 and C4C_4 are compatible (11 step each), yielding 2+2+1+1=62 + 2 + 1 + 1 = 6 steps.

  3. Add the steps required by C5C_5: on T1T_1, C5C_5 requires 11 step; on T2T_2, C5C_5 requires 22 steps.

  4. Compute total tree lengths: Length(T1)=6+1=7\text{Length}(T_1) = 6 + 1 = 7 steps, Length(T2)=6+2=8\text{Length}(T_2) = 6 + 2 = 8 steps.

Final answer

(1) Tree length for T1=7T_1 = 7 steps, Tree length for T2=8T_2 = 8 steps; (2) Topology T1=((P,Q),(R,S))T_1 = ((P, Q), (R, S)) is favored by 11 step.

NEXT STEPS
Final Takeaways from Your Teacher
  • Create a matrix of characters vs. topologies to track individual step counts before summing tree lengths.

  • Practice drawing homoplastic mapping on 4-taxon unrooted trees to visually verify why an incompatible split demands 22 steps.

Lock it in

Similar question

01

Four taxa (A,B,C,DA, B, C, D) are evaluated across three binary characters. Character 11 has states A=1,B=1,C=0,D=0A=1, B=1, C=0, D=0. Character 22 has states A=1,B=0,C=1,D=0A=1, B=0, C=1, D=0. Character 33 has states A=1,B=1,C=1,D=1A=1, B=1, C=1, D=1. Calculate the tree length of topology T=((A,B),(C,D))T = ((A, B), (C, D)) across all three characters.

Answer

Tree length = 33 steps. Character 11 matches the split and costs 11 step. Character 22 conflicts with the split and costs 22 steps. Character 33 is invariant across all taxa and costs 00 steps. Total length = 1+2+0=31 + 2 + 0 = 3 steps.

02

A dataset of four taxa (W,X,Y,ZW, X, Y, Z) contains 1010 parsimony-informative characters with 2:22:2 splits. Five characters support unrooted topology T1=((W,X),(Y,Z))T_1 = ((W, X), (Y, Z)), three characters support T2=((W,Y),(X,Z))T_2 = ((W, Y), (X, Z)), and two characters support T3=((W,Z),(X,Y))T_3 = ((W, Z), (X, Y)). Determine the parsimony length of each topology and state which tree is optimal.

Answer

Length(T1T_1) = 1515 steps, Length(T2T_2) = 1717 steps, Length(T3T_3) = 1818 steps; T1T_1 is optimal. On T1T_1, the 55 supporting characters cost 11 step each (55), while the 55 conflicting characters cost 22 steps each (1010), giving 5+10=155 + 10 = 15. For T2T_2: 3(1)+7(2)=173(1) + 7(2) = 17. For T3T_3: 2(1)+8(2)=182(1) + 8(2) = 18.

03

Four taxa (1,2,3,41, 2, 3, 4) have four binary characters: C1=[0,0,1,1]C_1 = [0, 0, 1, 1], C2=[0,1,0,1]C_2 = [0, 1, 0, 1], C3=[0,0,0,1]C_3 = [0, 0, 0, 1], and C4=[1,1,1,1]C_4 = [1, 1, 1, 1] (states listed in taxon order 1,2,3,41, 2, 3, 4). For the two trees TA=((1,2),(3,4))T_A = ((1, 2), (3, 4)) and TB=((1,3),(2,4))T_B = ((1, 3), (2, 4)), calculate their lengths and determine if parsimony can resolve the relationship between them.

Answer

Length(TAT_A) = 44 steps, Length(TBT_B) = 55 steps; parsimony resolves TAT_A as optimal. C1C_1 costs 11 on TAT_A and 22 on TBT_B. C2C_2 costs 22 on TAT_A and 11 on TBT_B. C3C_3 is an autapomorphy (informative only for a single branch), costing 11 step on both trees. C4C_4 is invariant, costing 00 steps on both trees. Thus, Length(TAT_A) = 1+2+1+0=41 + 2 + 1 + 0 = 4 steps, and Length(TBT_B) = 2+1+1+0=52 + 1 + 1 + 0 = 5 steps.

Loading workspace…