Effective online Bayesian phylogenetics via sequential Monte Carlo with guided proposals

Publication Type:
Journal Article
Citation:
bioRxiv, 2017
Issue Date:
2017-06-02
Full metadata record
Files in This Item:
Filename Description Size
\\utsfs.adsroot.uts.edu.au\homes\staff\990777\Desktop\145219.full.pdfAccepted Manuscript Version19.76 MB
Adobe PDF
Modern infectious disease outbreak surveillance produces continuous streams of sequence data which require phylogenetic analysis as data arrives. Current software packages for Bayesian phylogenetic inference are unable to quickly incorporate new sequences as they become available, making them less useful for dynamically unfolding evolutionary stories. This limitation can be addressed by applying a class of Bayesian statistical inference algorithms called sequential Monte Carlo (SMC) to conduct online inference, wherein new data can be continuously incorporated to update the estimate of the posterior probability distribution. In this paper we describe and evaluate several di erent online phylogenetic sequential Monte Carlo (OPSMC) algorithms. We show that proposing new phylogenies with a density similar to the Bayesian prior su ers from poor performance, and we develop `guided' proposals that better match the proposal density to the posterior. Furthermore, we show that the simplest guided proposals can exhibit pathological behavior in some situations, leading to poor results, and that the situation can be resolved by heating the proposal density. The results demonstrate that relative to the widely-used MCMC-based algorithm implemented in MrBayes, the total time required to compute a series of phylogenetic posteriors as sequences arrive can be signi cantly reduced by the use of OPSMC, without incurring a signi cant loss in accuracy.
Please use this identifier to cite or link to this item: