PBPI: a High Performance Implementation of Bayesian Phylogenetic Inference
Xizhou Feng
Kirk W. Cameron
Duncan A. Buell
Dept. of Comput. Sci., Virginia Polytech. Inst. & State Univ., Blacksburg, VA;
This paper appears in: SC 2006 Conference, Proceedings of the ACM/IEEE
Publication Date: Nov. 2006
On page(s): 40-40
Location: Tampa, FL,
ISBN: 0-7695-2700-0
INSPEC Accession Number: 9343094
Digital Object Identifier: 10.1109/SC.2006.47
Current Version Published: 2007-02-12
Abstract
This paper describes the implementation and performance of PBPI, a parallel implementation of Bayesian phylogenetic inference method for DNA sequence data. By combining the Markov chain Monte Carlo (MCMC) method with likelihood-based assessment of phylogenies, Bayesian phylogenetic inferences can incorporate complex statistic models into the process of phylogenetic tree estimation. However, Bayesian analyses are extremely computationally expensive. PBPI uses algorithmic improvements and parallel processing to achieve significant performance improvement over comparable Bayesian phylogenetic inference programs. We evaluated the performance and accuracy of PBPI using a simulated dataset on System X, a terascale supercomputer at Virginia Tech. Our results show that PBPI identifies equivalent tree estimates 1424 times faster on 256 processors than a widely-used, best-available (albeit sequential), Bayesian phylogenetic inference program. PBPI also achieves linear speedup with the number of processors for large problem sizes. Most importantly, the PBPI framework enables Bayesian phylogenetic analysis of large datasets previously impracticable
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
