1 / 12

Parametric Bootstrap (Efron 1985; Huelsenbeck et al. 1996)

Parametric Bootstrap (Efron 1985; Huelsenbeck et al. 1996). 1) build best tree 2) generate new simulated data sets using estimated branch lengths and other parameters (e.g., alpha and substitution model) (from tree/data) 3) build new tree for each simulated data set

Download Presentation

Parametric Bootstrap (Efron 1985; Huelsenbeck et al. 1996)

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Parametric Bootstrap(Efron 1985; Huelsenbeck et al. 1996) 1) build best tree 2) generate new simulated data sets using estimated branch lengths and other parameters (e.g., alpha and substitution model) (from tree/data) 3) build new tree for each simulated data set 4) determine what fraction of the trees come out with each topology or generate majority rule consensus 5) assign p values

  2. Parametric Bootstrap Simulation 1 Germ Neand CCTGGCATAA ATCGCATACG Rus Neand CCTGGCATAA ATCGCATACG Europ. Hum CCTGGCATTA ATCGCATTCG Chimp trog ACTGGCTTTA ATCGCATTCG Chimp Schw ACTGGCTTTA ATCGCATTCG Chimp venus ACTGGCATTA ATCGCATTCG T1 Simulation 2 Germ Neand ACAGGCATAA ATCGCATACG Rus Neand ACAGGCATAA ATCGCATACG Europ. Hum ACAGGCATTA ATCGCATTCG Chimp trog ACTGGCTTTA ATCGCATTCG Chimp Schw ACTGGCTTTA ATCGCATTCG Chimp venus ACTGGCATTA ATCGCATTCG T2 Use tree branches and model to simulate new data matrices Simulation 3 Germ Neand ACAGGCATAA ATCGCATACG Rus Neand ACAGGCATAA ATCGCATACG Europ. Hum ACAGGCATTA ATCGCATTCG Chimp trog ACTGGCTTTA ATCGCATTCG Chimp Schw ACTGGCTTTA ATCGCATTCG Chimp venus ACTGGCATTA ATCGCATTCG T3 To n replicates

  3. Paired-Sites Tests Examines the number of sites supporting tree 1 versus number of sites supporting tree 2 with the null model that the trees do not differ any more than would be expected by random error: “…if two trees have equal log-likelihoods, the differences in log-likelihoods at each site will be drawn independently from some distribution whose expectation is zero. If we do a statistical test of whether the mean differences is zero, we are then also testing whether there is significant statistical evidence that one tree is better than another.” Felsenstein (2004) • Winning sites & Templeton Wilcoxon sign test • Kishino-Hasegawa (KH) • Shimodaira-Hasegawa (SH)

  4. from Felsenstein. 2004. Inferring Phylogenies.

  5. from Felsenstein. 2004. Inferring Phylogenies.

  6. Sign Tests Work with parsimony or maximum likelihood scores Records treelengths (steps or likelihoods) for each character Winning sites model sums the number of sites supporting tree A versus number of sites supporting tree B and vice versa (those having better fit, fewer steps, on alternative tree). Test against a binomial distribution: determine what fraction of winning sites significantly different from expectation of 0.5 Wilcoxon signed ranks test Templeton (1983) replaces character differences with their rank and then uses Wilcoxon rank sum to test between two trees

  7. from Felsenstein. 2004. Inferring Phylogenies.

  8. Kishino-Hasegawa Test (1989) * carry ML analysis for two (or more) trees * obtain difference (δ) in likelihood scores for each site (with expectation of zero if trees are not different) * calculate variance among sites in likelihood differences (σ2) * if δ /σ > 1.96 reject the null hypothesis (that trees are equivalent)

  9. from Felsenstein. 2004. Inferring Phylogenies.

  10. From Jim Wilgenbusch: http://bio.fsu.edu/~stevet/BSC5936/Wilgenbusch.2003.pdf

  11. From Page (2003) Tangled Trees

More Related