Lecture 8 Flashcards

1
Q

What happens if you have more than one “best tree”?

A

create a consensus tree

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

majority-rule consensus tree

A

includes clades only present in specified number of “best” trees, with the % scores at each node

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

Confidence in phylogenetic inferences can be thought of in 2 ways:

A

1) dtmn if there is meaningful signal in dataset

2) assess confidence in particular clades/topological conclusions

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

detecting nonrandomness in a set:

A

look at extent to which characters within a matrix contradict each other

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

Permutation Tail Prob (PTP) Test

A
  • using any method that assigns score to individual tree (pars, ME, ML)
  • compares score of shortest optimal tree to scores of trees found with random permuted data sets
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

parsimony PTP test

A

if length of shortest optimal tree is shorter than all/nearly all random trees-> data has more phylogenetic structure than would be expected from random

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

permutation

A

character states of each character independently shuffled among taxa

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

point estimate of phylogeny

A

pars, distance, and likliehood

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

decay index (Bremer Support)

A
  • difference in tree length between the optimal tree and the optimal tree lacking the clade in question
  • higher number means stronger support
  • for likelihood: diff in log-likleihood scores (ratios)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

bootstrap (general)

A
  • assesses the chances of recovering a particular clade again if we were able to sample from a new set of characters
  • simulates other possible datasets by randomly drawing from data
  • informs on consistency of branching patterns
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

nonparametric bootstrap

A
  • sampling with replacement (pseudoreplicate)
  • tree search performed on pseudoreplicate datasets and resulting tree(s) added to optimals
  • proportion of bootstrap trees with a given clade is the score
  • usually presented in a bootstrap consensus tree
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

jackknife

A

same as bootstrap but sampling WITHOUT replacement

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

parametric bootstraping

A
  • generates new data sets by simulating them with evolutionary model
  • used mostly in ML analyses to test specific hypotheses, not clade support (ie controversial placing of sister clades)
  • random seq conforming to models assumptions placed at base of tree and then allowed to evolve along branches-> repeat for all positions in seq and all branches in tree
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Bayesian posterior distribution

A
  • Bayesian not point estimate

- distribution has sample of trees ranked by prob that each is the true tree

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

Bayesian posterior probability (BPP)

A
  • majority-rule of topology examined
  • prob that tree is correct, assuming model is correct
  • clade-credibility values (0.0-1.0)
  • can be sensitive to model misspecification, use most complex model, faster
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Partition homogeneity test (PHT)

A
  • evaluates data set conflicts
  • randomly assigns characters to partitions many times and then conducts a phylogenetic analysis of random partitions
  • pars, ME, or ML
  • similar to PTP (smaller is better)
17
Q

Species tree

A

the relationships among spp when contrasted with gene trees; most assume gene-to-gene discordance due to incomplete lineage sorting

18
Q

Minimizing deep coalescence (MDC)

A
  • parsimony based
  • search among spp trees to find topology that minimizes the total # of deep coalescence events
  • shortcoming: fails to use branch length estimates from individual gene trees
19
Q

Multi-species coalescent

A
  • assumes gene coalescence always predates spp divergence
  • likelihood of gene tree given a spp tree is function of gene data/spp tree, including branch lengths and widths
  • L of a spp tree given set of genes is function of the summed gene likelihoods
20
Q

Bayesian concordance factor (BCA)

A
  • estimates the extent of gene discordance without assuming any one source
  • measure of the prior prob of gene-to-gene discordance to estimate the prop of genome for which any clade is true (concordance factor)
  • scores on tree