Trees - ML and Bayes Flashcards

1
Q

What does maximum likelihood do

A

it tries to infer a phylogenetic tree by finding the tree that maximizes the probability of observing the data, given certain assumptions (models)

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

How does the maximum likelihood process work

A

it requires explicitly models of rates of evolutionary change in the relevant characters and states, it begins with one tree (can be hypothesis or model) then goes on to compare the probability of the data for many different trees/models, searching across tree space for the tree that maximizes the likelihood of the data

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

The maximum likelihood method model includes what 4 things

A
  1. tree topology
  2. branch lengths
  3. nucleotide frequencies
  4. a substitution rate matrix/instantaneous rate matrix
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What are the 2 models for substitution rate matrix’s

A
  1. Jukes-Cantor (JC) model
  2. Kimura two parameter (K2P) model
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Describe the Jukes Cantor model used for maximum likelihood and finding the substitution rate matrix

A
  • it only has one parameter, the substitution rate, and assumes that all substitutions (changes of character state) are equally likely
  • the substitution rate is expressed as α (alpha) per time unit.
  • given enough time the probability of change to each of the other 3 states and the probability of no change all approach 0.25
  • each column or row adds up to zero
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Describe the Kimura two-parameter model used for maximum likelihood and finding the substitution rate matrix

A

this has one rate for transitions (α) and one rate for transversions (β)
- each column or row adds up to zero

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

What is a faster process: maximum likelihood or maximum parsimony

A
  • maximum parsimony - heuristic methods(traditional searching) is almost always used)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Describe bayesian inferene

A
  • built on likelihood methods
  • based on matrix of character states and requires an evaluation of all possible trees or a heuristic sample of them
  • it involves beginning with prior probabilities and then sequentially estimating revised posterior probabilities based on the observations actually made
  • it calculates the probability of the hypothesis given the data (reverse of ML)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What kind of method does the bayesian inference search involve

A

markov-chain monte carlo method (MCMC) - this is a random walk simulation–> this leads to convergence on a set of trees for which the likelihoods are similar

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

Difference between Bayesian inference and maximum likelihood

A
  • ML = finds the tree that maximizes the probability of observing the data given certain assumptions/models
  • Bayesian = calculates the probability of the hypothesis given the data
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What is the Bayesian inference model sensitive to

A

priors and model misspecification

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

What is the order for the methods of tree construction

A
  1. cluster analysis
  2. maximum parsimony
  3. likelihood methods (ML, BI)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly