Chapter 5 Flashcards

1
Q

Wrote The Principles of Numerical Taxonomy,

A

obert Sokal and Peter Sneath

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

Essentially assessed overall similarity and Often referred to as Phenetics

A

Numerical Taximony

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q
  • Intellectual successor to NT

* Count pairwise differences between species

A

Genetic Distance Based Method

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

Slowed American acceptance and set up a battle between pheneticists and cladists that continued until the 1980’s
• Goal: develop an objective taxonomy and a method for phylogenetic reconstruction

A

Willi Hennig

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

find the tree with the minimum amount of homoplasy (convergences, reversals, parallelisms)
fewest evolutionary changes

A

maximum parsimony

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

Phylogenetic Analysis Using Parsimony

A

PAUP* (Swofford)

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

very fast tree-searching algorithms

A

TNT (Goloboff)

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

Rarely do you get just one most parsimonious tree

• What do you do when each of these is equally likely?

A

Consensus Trees

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

only those nodes found in all most parsimonious trees represented

A

Strict consensus

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

nodes found in greater than 50% of trees represented

A

Majority Rule consensus

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

Sampling with replacement

A

Bootstrap analysis - about 75% is good

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

in tree support what is the ultimate test?

A

congruence

Congruence - does the tree in one analysis match the tree of another?

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

Transitions

A

purines (AG) or

pyrimidines (CT) - easier

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

Transversions

A

urines and pyrimidines (AT, AC, GT, GC) =harder

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

• Simplest based on transmission codes

A

= Neighbor Joining - doesn’t assume equal rates of DNA sequence evolution

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

• Third position based on transmission codes

A

easiest - least likely to alter amino acid •

17
Q

First - based on transmission codes

A

middle, second - hardest

18
Q

calculates the tree that best fits the data and model

A

Maximum Likelihood

19
Q

Runs numerous simulations of the data to maximize probability for the tree (Markov Chain Monte Carlo)

A

Bayesian Analysis

20
Q

Maximum likihood uses

A

bootstrap

21
Q

Bayesian Analysis

A

posterior probabilities, close to a statistic, but tend to overestimate support

22
Q

based originally on a fixed rate of change

A

Molecular clocks

23
Q

alter rates along branches

A

• BEAST: Relaxed clock – requires fossil

24
Q

Show us that basing a taxonomy means difficult changes

• 2 examples – horses and tetrapods

A

Fossils and Phylogeny

25
Q

Vertebrates to Land

A

Without fossils, this would be confusing
• Major changes to shoulder, pelvis, ear, skull, etc.
• Well known and studied
• A group of lobe-finned fishes lost dorsal fins, lost connection of pectoral to skull, gained digits, gained connection of pelvic girdle to vertebrae, etc.

26
Q

Very common fossil, long known- fish

A

Eusthenopteron

27
Q

Recent fossil, no dorsal fin-fish

A

Panderichthys

28
Q

Gills as adult, no dorsal fin, but with wrists and a cervical vertebra Verdict: ? Fishapod?

A

Tiktaalik

29
Q

use phylogeography to understand what

A

continental drift

30
Q

Who proposed Continental Drift

A

Alfred Wegener

31
Q

movement

A

dispersal

32
Q

sepration due to geological processes

A

Vicariance

33
Q

Phylogenetic Independent Contrasts

A

( A-B ) divided by branch length