L1 Phylogenetics Flashcards

You may prefer our related Brainscape-certified flashcards:
1
Q

Phenetics

A

Classify organisms on how similar they are

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

Linnean Taxonomy

A

classifying organisms into various ranks e.g. phylum, kingdom, class, order, genus, species

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

Cladists

A

See OneNote diagram

Classifying organisms on their evolutionary history, “shared derived characters”
- share the same evolutionary derived characteristics that the ancestral species does not have

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

Molecular Phylogenetics

A
  • protein electrophoresis
  • DNA:DNA hybridisation
  • Sequences
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

How is phylogeny determined?

A
  • identify homologous characters

- homology: derived from a common ancestor

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

Alignments and homology

A

See OneNote

  • Asserting homology based on alignment
  • the alignment problem
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Taxa

A

Species

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

Node

A

point at the end of the tree or where the tree branches

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

Clade

A

grouping e.g. mammals grouped together

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

Phylogenetic trees

A

depict the evolutionary history of the taxa

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

Fundamental properties of Phylogenetic trees

A
  • network without cycles, usually bifurcating
  • polytomies, star phylogenies indicate failures to resolve the nodes into bifurcations, data set cannot resolve the correct order or the species has split into three
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Cladogram

A
  • just the clades, topology
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Ultrametric tree

A
  • has a root
  • terminal nodes align
  • time axis included
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Phylogram

A
  • branch length proportional to distance/number of changes
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Topology

A

Grouping of tree

Trees can be drawn in different ways to represent the same thing as long as the topology is the same

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

Root

A

See OneNote diagram

Rooting affects the interpretation of the tree

Deciding where the root should be:

  • Assume out-root species to decide where to root the tree from
  • Assert a molecular clock, assume rate of change e.g. amino acid/nucleotide changes, most divergent species would be the root
17
Q

Parsimony Principle

A

the one that takes the fewest steps is the most likely to have been the real scenario

18
Q

Are all variable sites equally useful in drawing the tree?

A

See OneNote

  • parsimony informative
  • singleton site
19
Q

Homoplasy

A

changing twice to go back to the same state

20
Q

Small parsimony problem

A

for a given tree what is the minimal number of steps required to explain the data

21
Q

Large parsimony problem

A

which of all the possible trees has the smallest minimum number of steps?

22
Q

Possible number of tree topologies

A
N = number of taxa
# of tree topologies = 2N-5
23
Q

Searching tree space

A
  • branch and bound = exact method, will find the shortest tree
  • heuristic method = branch swapping
24
Q

Nearest neighbour interchange

A

See OneNote

25
Q

Subtree pruning and regrafting

A

See OneNote

- all possible subtree removals and reattachment points are evaluated but the cut point is the reattachment point

26
Q

Tree bisection and reconnection

A

See OneNote

  • all possible bisections and reattachment points are evaluated
  • cut point is not necessarily the reattachment point
27
Q

What do you do when you have multiple trees that are equally short?

A
  • build a consensus tree
28
Q

Strict consensus

A

See OneNote

Record the internal branches that are seen in all four trees, the other we collapse into a point of uncertainty - nodes collapsed to polytomy

29
Q

70% majority rule consensus

A

See OneNote

If a particular branch/clade is in at least 70% of the trees then it is represented in the consensus tree

30
Q

Distance methods

A
  • lose info by reducing the data set to the distance matrix

- fast

31
Q

Distance Matrix

A

See OneNote

32
Q

Bootstrap

A

See OneNote diagram

  • Sub-sampling your data
  • Sample columns randomly to put into new data set to create pseudo-data set
  • generate a consensus of bootstrapped datasets
33
Q

Assumptions

A
  • sites evolve independently of each other
  • all changes are equally likely
    BUT transitions usually occur more often than transversions
34
Q

Parsimony Informative Site

A

A site is parsimony-informative if it contains at least two types of nucleotides (or amino acids), and at least two of them occur with a minimum frequency of two.