Online tree expansion could help solve the problem of scalability in Bayesian phylogenetics.
Name
syad045__1_.pdf
Description
visibility:open
Size
957.2 KB
Format
Adobe PDF
Checksum (CRC64NVME)
X0GNO2EorL0=
Resource type
Journal article
Date published
July 27, 2023
Abstract
Bayesian phylogenetics is now facing a critical point. Over the last 20 years, Bayesian methods have reshaped phylogenetic inference and gained widespread popularity due to their high accuracy, the ability to quantify the uncertainty of inferences and the possibility of accommodating multiple aspects of evolutionary processes in the models that are used. Unfortunately, Bayesian methods are computationally expensive, and typical applications involve at most a few hundred sequences. This is problematic in the age of rapidly expanding genomic data and increasing scope of evolutionary analyses, forcing researchers to resort to less accurate but faster methods, such as maximum parsimony and maximum likelihood. Does this spell doom for Bayesian methods? Not necessarily. Here, we discuss some recently proposed approaches that could help scale up Bayesian analyses of evolutionary problems considerably. We focus on two particular aspects: online phylogenetics, where new data sequences are added to existing analyses, and alternatives to Markov chain Monte Carlo (MCMC) for scalable Bayesian inference. We identify five specific challenges and discuss how they might be overcome. We believe that online phylogenetic approaches and Sequential Monte Carlo hold great promise and could potentially speed up tree inference by orders of magnitude. We call for collaborative efforts to speed up the development of methods for real-time tree expansion through online phylogenetics.
Project(s)
Priority 3: Digital Revolution
Priority 2: Trait Diversity and Function
Journal title
Systematic Biology
Volume
72
Issue
5
Article number
syad045
Publisher
Oxford University Press (OUP)
Place of publication
Oxford, UK
ISSN
1063-5157
eISSN
1076-836X
Official URL
Rights statement
In Copyright
Additional information
IF = 9.16 (2022-2023)