## Parallel algorithms for Bayesian phylogenetic inference (2003)

Venue: | Journal of Parallel Distributed Computing |

Citations: | 11 - 3 self |

### BibTeX

@ARTICLE{Feng03parallelalgorithms,

author = {Xizhou Feng and A Duncan A. Buell and John R. Rose and Peter J. Waddell B},

title = {Parallel algorithms for Bayesian phylogenetic inference},

journal = {Journal of Parallel Distributed Computing},

year = {2003},

volume = {63},

pages = {707--718}

}

### OpenURL

### Abstract

The combination of a Markov chain Monte Carlo (MCMC) method with likelihood-based assessment of phylogenies is becoming a popular alternative to direct likelihood optimization. However, MCMC, like maximum likelihood, is a computationallyexpensive method. To approximate the posterior distribution of phylogenies, a Markov chain is constructed, using the Metropolis algorithm, such that the chain has the posterior distribution of the parameters of phylogenies as its stationary distribution. This paper describes parallel algorithms and their MPI-based parallel implementation for MCMC-based Bayesian phylogenetic inference. Bayesian phylogenetic inference is computationally expensive both in time and in memory requirements. Our variations on MCMC and their implementation were done to permit the studyof large phylogenetic problems. In our approach, we can distribute either entire chains or parts of a chain to different processors, since in current models the columns of the data are independent. Evaluations on a 32-node Beowulf cluster suggest the problem scales well. A number of important points are identified, including a superlinear speedup due to more effective cache usage and the point at which additional processors slow down the process due to communication overhead.