Lecture 7 Flashcards
0
Q
MCMC
A
Markov chain Monte Carlo; Bayesian search strategy; stats near tops
-uphill: always; slightly downhill: usually; drastic off: almost never
1
Q
Branch-and-bound
A
Exact search method; add taxa-> look for length less than previous-> proceed; 15-20 taxa
2
Q
Burn-in
A
Time until arriving at peak; 1st steps from starting point
3
Q
MCMCMC
A
Metropolis coupled; heated chains scout for cold (high peaks); decides best temp for research
4
Q
Fitch parsimony
A
Unordered/equally weighted characters
5
Q
Wagner parsimony
A
Ordered, generalized, or weighted characters; compare costs not length
