Bioinformatics 10: Phylogeny 2 Flashcards

1
Q

Strengths and weaknesses of evolutionary distance-based tree construction?

A

Strengths:
Computationally simple and quick
Distance correction

Weaknesses:
No insight about actual evolutionary changes
UPGMA (but not NJ) assumes a molecular clock
At longer times, distance are non-linear (require correction)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Occam’s razor - relation to character-based methods?

A

simple hypotheses are preferable to more complicated ones

  • smallest number of evolutionary changes in a tree = most favourable i.e. Maximum Parsimony
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Informative vs Non-informative base changes / SNPs between sequences?

A
Informative = 1 type of change at a given point (2 variable bases)
Non-informative = more than 1 type of change at a given point  (3 or more variable bases)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Strengths and weaknesses of Maximum Parsimony (character-based) trees?

A

Strengths:

  • does not reduce sequence information to a single number
  • tries to provide information on the ancestral sequenes
  • evaluates different trees

Weaknesses:

  • computationally expensive (large no. of trees to consider)
  • does not correct for multiple mutations (does not imply a model of evolution)
  • evolution is not necessarily parsimonious (Occam’s razor not necessarily correct)
  • no info on branch lengths/distances
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Statistical technique used to compare trees and find the ‘best’ one?

A

Bootstrapping

% of the time a given tree is ‘better’ than other compared trees

How well did you know this?
1
Not at all
2
3
4
5
Perfectly