Many-core algorithms for high-dimensional gradients on phylogenetic trees
© The Author(s) 2024. Published by Oxford University Press..
MOTIVATION: Advancements in high-throughput genomic sequencing are delivering genomic pathogen data at an unprecedented rate, positioning statistical phylogenetics as a critical tool to monitor infectious diseases globally. This rapid growth spurs the need for efficient inference techniques, such as Hamiltonian Monte Carlo (HMC) in a Bayesian framework, to estimate parameters of these phylogenetic models where the dimensions of the parameters increase with the number of sequences N. HMC requires repeated calculation of the gradient of the data log-likelihood with respect to (wrt) all branch-length-specific (BLS) parameters that traditionally takes O(N2) operations using the standard pruning algorithm. A recent study proposes an approach to calculate this gradient in O(N), enabling researchers to take advantage of gradient-based samplers such as HMC. The CPU implementation of this approach makes the calculation of the gradient computationally tractable for nucleotide-based models but falls short in performance for larger state-space size models, such as Markov-modulated and codon models. Here, we describe novel massively parallel algorithms to calculate the gradient of the log-likelihood wrt all BLS parameters that take advantage of graphics processing units (GPUs) and result in many fold higher speedups over previous CPU implementations.
RESULTS: We benchmark these GPU algorithms on three computing systems using three evolutionary inference examples exploring complete genomes from 997 dengue viruses, 62 carnivore mitochondria and 49 yeasts, and observe a >128-fold speedup over the CPU implementation for codon-based models and >8-fold speedup for nucleotide-based models. As a practical demonstration, we also estimate the timing of the first introduction of West Nile virus into the continental Unites States under a codon model with a relaxed molecular clock from 104 full viral genomes, an inference task previously intractable.
AVAILABILITY AND IMPLEMENTATION: We provide an implementation of our GPU algorithms in BEAGLE v4.0.0 (https://github.com/beagle-dev/beagle-lib), an open-source library for statistical phylogenetics that enables parallel calculations on multi-core CPUs and GPUs. We employ a BEAGLE-implementation using the Bayesian phylogenetics framework BEAST (https://github.com/beast-dev/beast-mcmc).
| Errataetall: | |
|---|---|
| Medienart: |
E-Artikel |
| Erscheinungsjahr: |
2024 |
|---|---|
| Erschienen: |
2024 |
| Enthalten in: |
Zur Gesamtaufnahme - volume:40 |
|---|---|
| Enthalten in: |
Bioinformatics (Oxford, England) - 40(2024), 2 vom: 01. Feb. |
| Sprache: |
Englisch |
|---|
| Beteiligte Personen: |
Gangavarapu, Karthik [VerfasserIn] |
|---|
| Links: |
|---|
| Themen: |
|---|
| Anmerkungen: |
Date Completed 05.02.2024 Date Revised 28.02.2024 published: Print UpdateOf: ArXiv. 2023 Mar 8;:. - PMID 36945693 Citation Status MEDLINE |
|---|
| doi: |
10.1093/bioinformatics/btae030 |
|---|
| funding: |
|
|---|---|
| Förderinstitution / Projekttitel: |
|
| PPN (Katalog-ID): |
NLM36734193X |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | NLM36734193X | ||
| 003 | DE-627 | ||
| 005 | 20240229234808.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 240120s2024 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1093/bioinformatics/btae030 |2 doi | |
| 028 | 5 | 2 | |a pubmed24n1311.xml |
| 035 | |a (DE-627)NLM36734193X | ||
| 035 | |a (NLM)38243701 | ||
| 035 | |a (PII)btae030 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 100 | 1 | |a Gangavarapu, Karthik |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Many-core algorithms for high-dimensional gradients on phylogenetic trees |
| 264 | 1 | |c 2024 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ƒaComputermedien |b c |2 rdamedia | ||
| 338 | |a ƒa Online-Ressource |b cr |2 rdacarrier | ||
| 500 | |a Date Completed 05.02.2024 | ||
| 500 | |a Date Revised 28.02.2024 | ||
| 500 | |a published: Print | ||
| 500 | |a UpdateOf: ArXiv. 2023 Mar 8;:. - PMID 36945693 | ||
| 500 | |a Citation Status MEDLINE | ||
| 520 | |a © The Author(s) 2024. Published by Oxford University Press. | ||
| 520 | |a MOTIVATION: Advancements in high-throughput genomic sequencing are delivering genomic pathogen data at an unprecedented rate, positioning statistical phylogenetics as a critical tool to monitor infectious diseases globally. This rapid growth spurs the need for efficient inference techniques, such as Hamiltonian Monte Carlo (HMC) in a Bayesian framework, to estimate parameters of these phylogenetic models where the dimensions of the parameters increase with the number of sequences N. HMC requires repeated calculation of the gradient of the data log-likelihood with respect to (wrt) all branch-length-specific (BLS) parameters that traditionally takes O(N2) operations using the standard pruning algorithm. A recent study proposes an approach to calculate this gradient in O(N), enabling researchers to take advantage of gradient-based samplers such as HMC. The CPU implementation of this approach makes the calculation of the gradient computationally tractable for nucleotide-based models but falls short in performance for larger state-space size models, such as Markov-modulated and codon models. Here, we describe novel massively parallel algorithms to calculate the gradient of the log-likelihood wrt all BLS parameters that take advantage of graphics processing units (GPUs) and result in many fold higher speedups over previous CPU implementations | ||
| 520 | |a RESULTS: We benchmark these GPU algorithms on three computing systems using three evolutionary inference examples exploring complete genomes from 997 dengue viruses, 62 carnivore mitochondria and 49 yeasts, and observe a >128-fold speedup over the CPU implementation for codon-based models and >8-fold speedup for nucleotide-based models. As a practical demonstration, we also estimate the timing of the first introduction of West Nile virus into the continental Unites States under a codon model with a relaxed molecular clock from 104 full viral genomes, an inference task previously intractable | ||
| 520 | |a AVAILABILITY AND IMPLEMENTATION: We provide an implementation of our GPU algorithms in BEAGLE v4.0.0 (https://github.com/beagle-dev/beagle-lib), an open-source library for statistical phylogenetics that enables parallel calculations on multi-core CPUs and GPUs. We employ a BEAGLE-implementation using the Bayesian phylogenetics framework BEAST (https://github.com/beast-dev/beast-mcmc) | ||
| 650 | 4 | |a Journal Article | |
| 650 | 7 | |a Codon |2 NLM | |
| 650 | 7 | |a Nucleotides |2 NLM | |
| 700 | 1 | |a Ji, Xiang |e verfasserin |4 aut | |
| 700 | 1 | |a Baele, Guy |e verfasserin |4 aut | |
| 700 | 1 | |a Fourment, Mathieu |e verfasserin |4 aut | |
| 700 | 1 | |a Lemey, Philippe |e verfasserin |4 aut | |
| 700 | 1 | |a Matsen, Frederick A |c 4th |e verfasserin |4 aut | |
| 700 | 1 | |a Suchard, Marc A |e verfasserin |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Bioinformatics (Oxford, England) |d 1998 |g 40(2024), 2 vom: 01. Feb. |w (DE-627)NLM094620342 |x 1367-4811 |7 nnns |
| 773 | 1 | 8 | |g volume:40 |g year:2024 |g number:2 |g day:01 |g month:02 |
| 856 | 4 | 0 | |u http://dx.doi.org/10.1093/bioinformatics/btae030 |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a GBV_NLM | ||
| 951 | |a AR | ||
| 952 | |d 40 |j 2024 |e 2 |b 01 |c 02 | ||