Bayesian inference in phylogeny

Bayesian inference of phylogeny background and bases

Bayesian inference or the inverse probability method was the standard approach in statistical thinking until the early 1900s before RA Fisher developed what's now known as the classical/frequentist/Fisherian inference. Computational difficulties and philosophical objections had prevented the widespread adoption of the Bayesian approach until the 1990s, when Markov Chain Monte Carlo (MCMC) algorithms revolutionized Bayesian computation.

The Bayesian approach to phylogenetic reconstruction combines the prior probability of a tree P(A) with the likelihood of the data (B) to produce a posterior probability distribution on trees P(A|B). The posterior probability of a tree will be the probability that the tree is correct, given the prior, the data, and the correctness of the likelihood model.

MCMC methods can be described in three steps: first using a stochastic mechanism a new state for the Markov chain is proposed. Secondly, the probability of this new state to be correct is calculated. Thirdly, a new random variable (0,1) is proposed. If this new value is less than the acceptance probability the new state is accepted and the state of the chain is updated. This process is run thousands or millions of times. The number of times a single tree is visited during the course of the chain is an approximation of its posterior probability. Some of the most common algorithms used in MCMC methods include the Metropolis–Hastings algorithms, the Metropolis-Coupling MCMC (MC³) and the LOCAL algorithm of Larget and Simon.

Metropolis–Hastings algorithm

One of the most common MCMC methods used is the Metropolis–Hastings algorithm, a modified version of the original Metropolis algorithm. It is a widely used method to sample randomly from complicated and multi-dimensional distribution probabilities. The Metropolis algorithm is described in the following steps:

1. An initial tree, Ti, is randomly selected.
2. A neighbour tree, Tj, is selected from the collection of trees.
3. The ratio, R, of the probabilities (or probability density functions) of Tj and Ti is computed as follows: R = f(Tj)/f(Ti)
4. If R ≥ 1, Tj is accepted as the current tree.
5. If R j is accepted as the current tree with probability R, otherwise Ti is kept.
6. At this point the process is repeated from Step 2 N times. The algorithm keeps running until it reaches an equilibrium distribution. It also assumes that the probability of proposing a new tree Tj when we are at the old tree state Ti, is the same probability of proposing Ti when we are at Tj. When this is not the case Hastings corrections are applied. The aim of Metropolis-Hastings algorithm is to produce a collection of states with a determined distribution until the Markov process reaches a stationary distribution. The algorithm has two components:
7. A potential transition from one state to another (i → j) using a transition probability function qi,j
8. Movement of the chain to state j with probability αi,j and remains in i with probability 1 – αi,j.

Metropolis-coupled MCMC

Metropolis-coupled MCMC algorithm (MC³) has been proposed to solve a practical concern of the Markov chain moving across peaks when the target distribution has multiple local peaks, separated by low valleys, are known to exist in the tree space. This is the case during heuristic tree search under maximum parsimony (MP), maximum likelihood (ML), and minimum evolution (ME) criteria, and the same can be expected for stochastic tree search using MCMC. This problem will result in samples not approximating correctly to the posterior density. The (MC³) improves the mixing of Markov chains in presence of multiple local peaks in the posterior density. It runs multiple (m) chains in parallel, each for n iterations and with different stationary distributions \pi_j(.)\ , j = 1, 2, \ldots, m\ , where the first one, \pi_1 = \pi\ is the target density, while \pi_j\ , j = 2, 3, \ldots, m\ are chosen to improve mixing. For example, one can choose incremental heating of the form:

: \pi_j(\theta) = \pi(\theta)^{1/[1+\lambda(j-1)]}, \ \ \lambda 0,

so that the first chain is the cold chain with the correct target density, while chains 2, 3, \ldots, m are heated chains. Note that raising the density \pi(.) to the power 1/T\ with T1\ has the effect of flattening out the distribution, similar to heating a metal. In such a distribution, it is easier to traverse between peaks (separated by valleys) than in the original distribution. After each iteration, a swap of states between two randomly chosen chains is proposed through a Metropolis-type step. Let \theta^{(j)}\ be the current state in chain j\ , j = 1, 2, \ldots, m\ . A swap between the states of chains i\ and j\ is accepted with probability:

: \alpha = \frac{\pi_i(\theta^{(j)})\pi_j(\theta^{(i)})}{\pi_i(\theta^{(i)})\pi_j(\theta^{(j)})}\

At the end of the run, output from only the cold chain is used, while those from the hot chains are discarded. Heuristically, the hot chains will visit the local peaks rather easily, and swapping states between chains will let the cold chain occasionally jump valleys, leading to better mixing. However, if \pi_i(\theta)/\pi_j(\theta)\ is unstable, proposed swaps will seldom be accepted. This is the reason for using several chains which differ only incrementally.

An obvious disadvantage of the algorithm is that m\ chains are run and only one chain is used for inference. For this reason, \mathrm{MC}^3\ is ideally suited for implementation on parallel machines, since each chain will in general require the same amount of computation per iteration.

LOCAL algorithm of Larget and Simon

The LOCAL algorithms offers a computational advantage over previous methods and demonstrates that a Bayesian approach is able to assess uncertainty computationally practical in larger trees. The LOCAL algorithm is an improvement of the GLOBAL algorithm presented in Mau, Newton and Larget (1999) in which all branch lengths are changed in every cycle. The LOCAL algorithms modifies the tree by selecting an internal branch of the tree at random. The nodes at the ends of this branch are each connected to two other branches. One of each pair is chosen at random. Imagine taking these three selected edges and stringing them like a clothesline from left to right, where the direction (left/right) is also selected at random. The two endpoints of the first branch selected will have a sub-tree hanging like a piece of clothing strung to the line. The algorithm proceeds by multiplying the three selected branches by a common random amount, akin to stretching or shrinking the clothesline. Finally the leftmost of the two hanging sub-trees is disconnected and reattached to the clothesline at a location selected uniformly at random. This would be the candidate tree.

Suppose we began by selecting the internal branch with length t_8\ that separates taxa A\ and B\ from the rest. Suppose also that we have (randomly) selected branches with lengths t_1\ and t_9\ from each side, and that we oriented these branches. Let m = t_1+t_8+t_9\ , be the current length of the clothesline. We select the new length to be m^{\star} = m\exp(\lambda(U_1-0.5))\ , where U_1\ is a uniform random variable on (0,1)\ . Then for the LOCAL algorithm, the acceptance probability can be computed to be:

:\frac{h(y)}{h(x)} \times \frac^3}{m^3}\

Assessing convergence

To estimate a branch length t of a 2-taxon tree under JC, in which n_1 sites are unvaried and n_2 are variable, assume exponential prior distribution with rate \lambda\ . The density is p(t) = \lambda e^{-\lambda t}\ . The probabilities of the possible site patterns are:

:1/4\left(1/4+3/4e^{-4/3t}\right)\

for unvaried sites, and

: 1/4\left(1/4-1/4e^{-4/3t}\right)\

Thus the unnormalized posterior distribution is:

: h(t) = \left(1/4\right)^{n_1+n_2}\left(1/4+3/4{e^{-4/3t}}^{n_1}\right)\

or, alternately,

: h(t) = \left(1/4-1/4{e^{-4/3t}}^{n_2}\right)(\lambda e^{-\lambda t})\

Update branch length by choosing new value uniformly at random from a window of half-width w\ centered at the current value:

: t^\star = |t+U|\

where U\ is uniformly distributed between -w\ and w\ . The acceptance probability is:

: h(t^\star)/h(t)\

Example: n_1 = 70\ , n_2 = 30\ . We will compare results for two values of w\ , w = 0.1\ and w = 0.5\ . In each case, we will begin with an initial length of 5\ and update the length 2000\ times.

Maximum parsimony and maximum likelihood

Maximum Parsimony recovers one or more optimal trees based on a matrix of discrete characters for a certain group of taxa and it does not require a model of evolutionary change. MP gives the most simple explanation for a given set of data, reconstructing a phylogenetic tree that includes as few changes across the sequences as possible. The support of the tree branches is represented by bootstrap percentage. For the same reason that it has been widely used, its simplicity, MP has also received criticism and has been pushed into the background by ML and Bayesian methods. MP presents several problems and limitations. As shown by Felsenstein (1978), MP might be statistically inconsistent, meaning that as more and more data (e.g. sequence length) is accumulated, results can converge on an incorrect tree and lead to long branch attraction, a phylogenetic phenomenon where taxa with long branches (numerous character state changes) tend to appear more closely related in the phylogeny than they really are. For morphological data, recent simulation studies suggest that parsimony may be less accurate than trees built using Bayesian approaches, potentially due to overprecision, although this has been disputed. Studies using novel simulation methods have demonstrated that differences between inference methods result from the search strategy and consensus method employed, rather than the optimization used.

As in maximum parsimony, maximum likelihood will evaluate alternative trees. However it considers the probability of each tree explaining the given data based on a model of evolution. In this case, the tree with the highest probability of explaining the data is chosen over the other ones. In other words, it compares how different trees predict the observed data. The introduction of a model of evolution in ML analyses presents an advantage over MP as the probability of nucleotide substitutions and rates of these substitutions are taken into account, explaining the phylogenetic relationships of taxa in a more realistic way. An important consideration of this method is the branch length, which parsimony ignores, with changes being more likely to happen along long branches than short ones. This approach might eliminate long branch attraction and explain the greater consistency of ML over MP. Although considered by many to be the best approach to inferring phylogenies from a theoretical point of view, ML is computationally intensive and it is almost impossible to explore all trees as there are too many. Bayesian inference also incorporates a model of evolution and the main advantages over MP and ML are that it is computationally more efficient than traditional methods, it quantifies and addresses the source of uncertainty and is able to incorporate complex models of evolution.

Pitfalls and controversies

• Bootstrap values vs posterior probabilities. It has been observed that bootstrap support values, calculated under parsimony or maximum likelihood, tend to be lower than the posterior probabilities obtained by Bayesian inference. This leads to a number of questions such as: Do posterior probabilities lead to overconfidence in the results? Are bootstrap values more robust than posterior probabilities? One fact underlying this controversy is that all data are used during Bayesian analysis and the calculation of posterior probabilities, while the nature of bootstrapping means that most bootstrap replicates will be missing some of the original data. As a result, bipartitions (branches) supported by relatively few characters in the dataset may receive very high posterior probabilities but moderate or even low bootstrap support, as many of the bootstrap replicates don't contain enough of the critical characters to retrieve the bipartition.
• Controversy of using prior probabilities. Using prior probabilities for Bayesian analysis has been seen by many as an advantage as it provides a way of incorporating information from sources other than the data being analyzed. However, when such external information is lacking, one is forced to use a prior even if it is impossible to use a statistical distribution to represent total ignorance. It is also a concern that the Bayesian posterior probabilities may reflect subjective opinions when the prior is arbitrary and subjective.
• Model choice. The results of the Bayesian analysis of a phylogeny are directly correlated to the model of evolution chosen so it is important to choose a model that fits the observed data, otherwise inferences in the phylogeny will be erroneous. Many scientists have raised questions about the interpretation of Bayesian inference when the model is unknown or incorrect. For example, an oversimplified model might give higher posterior probabilities.

MrBayes software

MrBayes is a free software tool that performs Bayesian inference of phylogeny. It was originally written by John P. Huelsenbeck and Frederik Ronquist in 2001. As Bayesian methods increased in popularity, MrBayes became one of the software of choice for many molecular phylogeneticists. It is offered for Macintosh, Windows, and UNIX operating systems and it has a command-line interface. The program uses the standard MCMC algorithm as well as the Metropolis coupled MCMC variant. MrBayes reads aligned matrices of sequences (DNA or amino acids) in the standard NEXUS format.

MrBayes uses MCMC to approximate the posterior probabilities of trees. The user can change assumptions of the substitution model, priors and the details of the MC³ analysis. It also allows the user to remove and add taxa and characters to the analysis. The program includes, among several nucleotide models, the most standard model of DNA substitution, the 4x4 also called JC69, which assumes that changes across nucleotides occur with equal probability. It also implements a number of 20x20 models of amino acid substitution, and codon models of DNA substitution. It offers different methods for relaxing the assumption of equal substitutions rates across nucleotide sites. MrBayes is also able to infer ancestral states accommodating uncertainty to the phylogenetic tree and model parameters.

MrBayes 3 was a completely reorganized and restructured version of the original MrBayes. The main novelty was the ability of the software to accommodate heterogeneity of data sets. This new framework allows the user to mix models and take advantages of the efficiency of Bayesian MCMC analysis when dealing with different type of data (e.g. protein, nucleotide, and morphological). It uses the Metropolis-Coupling MCMC by default.

MrBayes 3.2 was released in 2012. This version allows the users to run multiple analyses in parallel. It also provides faster likelihood calculations and allow these calculations to be delegated to graphics processing unites (GPUs). Version 3.2 provides wider outputs options compatible with FigTree and other tree viewers.

List of phylogenetics software

Main article: List of phylogenetics software

This table includes some of the most common phylogenetic software used for inferring phylogenies under a Bayesian framework. Some of them do not use exclusively Bayesian methods.

Applications

Bayesian Inference has extensively been used by molecular phylogeneticists for a wide number of applications. Some of these include: [[File:Divergence time estimation and ancestral area reconstruction of porcini s.s..png|thumb|Chronogram obtained from molecular clock analysis using BEAST. Pie chart in each node indicates the possible ancestral distributions inferred from Bayesian Binary MCMC analysis (BBM)]]

• Inference of phylogenies.
• Inference and evaluation of uncertainty of phylogenies.
• Inference of ancestral character state evolution.
• Inference of ancestral areas.
• Molecular dating analysis.
• Model dynamics of species diversification and extinction
• Elucidate patterns in pathogens dispersal.
• Inference of phenotypic trait evolution.

References

References

1. (September 1996). "Probability distribution of molecular evolutionary trees: A new method of phylogenetic inference". Journal of Molecular Evolution.
2. (1 July 1997). "Bayesian phylogenetic inference using DNA sequences: a Markov Chain Monte Carlo Method". Molecular Biology and Evolution.
3. (March 1999). "Bayesian Phylogenetic Inference via Markov Chain Monte Carlo Methods". Biometrics.
4. (June 2000). "Phylogenetic Tree Construction Using Markov Chain Monte Carlo". Journal of the American Statistical Association.
5. (1 August 2001). "MRBAYES: Bayesian inference of phylogenetic trees". Bioinformatics.
6. (1774). "Mémoire sur la Probabilité des Causes par les Évenements". Mémoires de l'Académie Royale des Sciences.
7. (October 2017). "A biologist's guide to Bayesian phylogenetic analysis". Nature Ecology & Evolution.
8. (April 1970). "Monte Carlo sampling methods using Markov chains and their applications". Biometrika.
9. (June 1953). "Equation of state calculations by fast computing machines". The Journal of Chemical Physics.
10. (2004). "Inferring phylogenies". Sinauer Associates.
11. (2014). "Molecular Evolution: A Statistical Approach". Oxford University Press.
12. (1991). "Computing Science and Statistics: Proceedings of the 23rd Symposium on the Interface.". Interface Foundation.
13. (June 1999). "Markov chain Monte Carlo algorithms for the Bayesian analysis of phylogenetic trees". Molecular Biology and Evolution.
14. (March 1999). "Bayesian phylogenetic inference via Markov chain Monte Carlo methods". Biometrics.
15. (December 1978). "Cases in which parsimony or compatibility methods will be positively misleading". Systematic Zoology.
16. (January 2017). "Fluctuations in population fecundity drive variation in demographic connectivity and metapopulation dynamics". Proceedings. Biological Sciences.
17. (April 2016). "Bayesian methods outperform parsimony but at the expense of precision in the estimation of phylogeny from discrete morphological data". Biology Letters.
18. (2018). "Weighted parsimony outperforms other methods of phylogenetic inference under models appropriate for morphology". Cladistics.
19. (February 2020). "Morphological phylogenetics evaluated using novel evolutionary simulations". Systematic Biology.
20. (1996). "Molecular Systematics, 2nd edition". Sinauer.
21. (December 2002). "Overcredibility of molecular phylogenies obtained by Bayesian phylogenetics". Proceedings of the National Academy of Sciences of the United States of America.
22. (February 2003). "Bayes or bootstrap? A simulation study comparing the performance of Bayesian Markov chain Monte Carlo sampling and bootstrapping in assessing phylogenetic confidence". Molecular Biology and Evolution.
23. (February 2003). "Comparison of Bayesian and maximum likelihood bootstrap measures of phylogenetic reliability". Molecular Biology and Evolution.
24. (January 2014). "Why some clades have low bootstrap frequencies and high Bayesian posterior probabilities". Israel Journal of Ecology & Evolution.
25. (18 April 2007). "Fair-Balance Paradox, Star-tree Paradox, and Bayesian Phylogenetics". Molecular Biology and Evolution.
26. (20 February 2018). "Bayesian selection of misspecified models is overconfident and may cause spurious posterior probabilities for phylogenetic trees". Proceedings of the National Academy of Sciences.
27. (October 2003). "Reliability of Bayesian posterior probabilities and bootstrap frequencies in phylogenetics". Systematic Biology.
28. (August 2001). "MRBAYES: Bayesian inference of phylogenetic trees". Bioinformatics.
29. (December 1997). "NEXUS: an extensible file format for systematic information". Systematic Biology.
30. (1969). "Evolution of Protein Molecules.". Academic Press.
31. (November 1993). "Maximum-likelihood estimation of phylogeny from DNA sequences when substitution rates differ over sites". Molecular Biology and Evolution.
32. (August 2003). "MrBayes 3: Bayesian phylogenetic inference under mixed models". Bioinformatics.
33. (May 2012). "MrBayes 3.2: efficient Bayesian phylogenetic inference and model choice across a large model space". Systematic Biology.
34. (August 2012). "Bayesian phylogenetics with BEAUti and the BEAST 1.7". Molecular Biology and Evolution.
35. (April 2014). "BEAST 2: a software platform for Bayesian evolutionary analysis". PLOS Computational Biology.
36. (June 2004). "A Bayesian mixture model for across-site heterogeneities in the amino-acid replacement process". Molecular Biology and Evolution.
37. (August 2006). "BAli-Phy: simultaneous Bayesian inference of alignment and phylogeny". Bioinformatics.
38. (February 2007). "Bayesian estimation of concordance among gene trees". Molecular Biology and Evolution.
39. (June 2003). "Inferences from DNA data: population histories, evolutionary processes and forensic match probabilities". Journal of the Royal Statistical Society, Series A (Statistics in Society).
40. (June 2006). "Bayesian analysis of correlated evolution of discrete characters by reversible-jump Markov chain Monte Carlo". The American Naturalist.
41. (2012). "Armadillo 1.1: an original workflow platform for designing and conducting phylogenetic analysis and simulations". PLOS ONE.
42. (January 2009). "TOPALi v2: a rich graphical interface for evolutionary analyses of multiple alignments on HPC clusters and multi-core desktops". Bioinformatics.
43. (March 2012). "Molecular phylogeny of an endemic radiation of Cuban toads (Bufonidae: Peltophryne) based on mitochondrial and nuclear genes". Journal of Biogeography.
44. (October 2011). "Mass extinction, gradual cooling, or rapid radiation? Reconstructing the spatiotemporal evolution of the ancient angiosperm genus Hedyosmum (Chloranthaceae) using empirical and simulated approaches". Systematic Biology.
45. (June 2012). "Bayesian models for comparative analysis integrating phylogenetic uncertainty". BMC Evolutionary Biology.
46. (September 2004). "Bayesian inference of character evolution". Trends in Ecology & Evolution.
47. (August 2010). "Ancestral state reconstruction reveals multiple independent evolution of diagnostic morphological characters in the "Higher Oribatida" (Acari), conflicting with current classification schemes". BMC Evolutionary Biology.
48. (July 2012). "Brunfelsia (Solanaceae): a genus evenly divided between South America and radiations on Cuba and other Antillean islands". Molecular Phylogenetics and Evolution.
49. (May 2012). "Miocene dispersal drives island radiations in the palm tribe Trachycarpeae (Arecaceae)". Systematic Biology.
50. (September 2013). "A phylogenetic framework for evolutionary study of the nightshades (Solanaceae): a dated 1000-tip tree". BMC Evolutionary Biology.
51. (May 2014). "Bayesian estimation of speciation and extinction from incomplete fossil occurrence data". Systematic Biology.
52. (September 2009). "Bayesian phylogeography finds its roots". PLOS Computational Biology.
53. (2015). "Assessing phenotypic correlation through the multivariate phylogenetic latent liability model". The Annals of Applied Statistics.
54. (2018). "Phylogenetic Factor Analysis". Systematic Biology.