Ques%ons
WERKCOLLEGE 1
1. Which topology shows different phylogene5c rela5onships compared to the other three?
C
2. Which genus is used to root the phylogeny?
Calotriton
3. What is the sister taxon of Lissotriton?
Triturus
4. Op5mize the character ‘crest presence’ with states ‘yes’ or ‘no’ on the phylogeny above; in
other words, show where evolu5onary changes happened (provide a picture/screenshot).
Red: no
Green: yes
5. The number of steps required is greater than the theore5cal minimum (which would be 1
step). How could this be?
The phylogeny is not only based on the trat ‘crest’ or ‘no crest’. There are other characters that
influence the number of steps a phylogeny has.
6. How many networks are possible? Draw them all out (insert a picture).
7. On how many branches could each network be rooted?
5
1
, 8. How many fully bifurca5ng (fully resolved) topologies are possible? Draw them all out (insert
a picture).
9. How many fully bifurca5ng topologies are possible if the outgroup is added?
15
10. Op5mize the characters ‘crest presence’ and ‘belly colour’ over all possible topologies. How
many steps does each topology require and which one is most parsimonious (provide a
picture)?
The with green circled tree is the most parsimonious
one. It has the least number of steps (2 steps), thus
the smallest amount of changes
2
WERKCOLLEGE 1
1. Which topology shows different phylogene5c rela5onships compared to the other three?
C
2. Which genus is used to root the phylogeny?
Calotriton
3. What is the sister taxon of Lissotriton?
Triturus
4. Op5mize the character ‘crest presence’ with states ‘yes’ or ‘no’ on the phylogeny above; in
other words, show where evolu5onary changes happened (provide a picture/screenshot).
Red: no
Green: yes
5. The number of steps required is greater than the theore5cal minimum (which would be 1
step). How could this be?
The phylogeny is not only based on the trat ‘crest’ or ‘no crest’. There are other characters that
influence the number of steps a phylogeny has.
6. How many networks are possible? Draw them all out (insert a picture).
7. On how many branches could each network be rooted?
5
1
, 8. How many fully bifurca5ng (fully resolved) topologies are possible? Draw them all out (insert
a picture).
9. How many fully bifurca5ng topologies are possible if the outgroup is added?
15
10. Op5mize the characters ‘crest presence’ and ‘belly colour’ over all possible topologies. How
many steps does each topology require and which one is most parsimonious (provide a
picture)?
The with green circled tree is the most parsimonious
one. It has the least number of steps (2 steps), thus
the smallest amount of changes
2
