Asymptotic Guarantees for Bayesian Phylogenetic Tree Reconstruction
From MaRDI portal
Cites work
- Computational phylogenetics. An introduction to designing methods for phylogeny estimation
- Consistency and convergence rate of phylogenetic inference via regularization
- Consistency and identifiability of the polymorphism-aware phylogenetic models
- Consistency of Bayesian inference of resolved phylogenetic trees
- Convergence rates of posterior distributions.
- Fundamentals of nonparametric Bayesian inference
- ggplot2. Elegant graphics for data analysis. With contributions by Carson Sievert
- Inverting random functions. III: Discrete MLE revisited
- Markov Chains
- Nonbifurcating Phylogenetic Tree Inference via the Adaptive LASSO
- On Bayes procedures
- On inconsistent Bayes estimates in the discrete case
- Phase transition in the sample complexity of likelihood-based phylogeny inference
- Teasing Apart Two Trees
- The coalescent
- The continuum random tree. III
This page was built for publication: Asymptotic Guarantees for Bayesian Phylogenetic Tree Reconstruction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6910908)