Phylogenies are central to many research areas in biology and commonly estimated using likelihood-based methods. Unfortunately, any likelihood-based method, including Bayesian inference, can be restrictively slow for large datasets-with many taxa and/or many sites in the sequence alignment-or complex substitutions models. The primary limiting factor when using large datasets and/or complex models in probabilistic phylogenetic analyses is the likelihood calculation, which dominates the total computation time. To address this bottleneck, we incorporated the high-performance phylogenetic library BEAGLE into RevBayes, which enables multi-threading on multi-core CPUs and GPUs, as well as hardware specific vectorized instructions for faster likelihood calculations. Our new implementation of RevBayes+BEAGLE retains the flexibility and dynamic nature that users expect from vanilla RevBayes. In addition, we implemented native parallelization within RevBayes without an external library using the message passing interface (MPI); RevBayes+MPI. We evaluated our new implementation of RevBayes+BEAGLE using multi-threading on CPUs and 2 different powerful GPUs (NVidia Titan V and NVIDIA A100) against our native implementation of RevBayes+MPI. We found good improvements in speedup when multiple cores were used, with up to 20-fold speedup when using multiple CPU cores and over 90-fold speedup when using multiple GPU cores. The improvement depended on the data type used, DNA or amino acids, and the size of the alignment, but less on the size of the tree. We additionally investigated the cost of rescaling partial likelihoods to avoid numerical underflow and showed that unnecessarily frequent and inefficient rescaling can increase runtimes up to 4-fold. Finally, we presented and compared a new approach to store partial likelihoods on branches instead of nodes that can speed up computations up to 1.7 times but comes at twice the memory requirements.
Download full-text PDF |
Source |
---|---|
http://dx.doi.org/10.1093/sysbio/syae005 | DOI Listing |
J Imaging Inform Med
January 2025
Department of Pathology, Sinopharm Tongmei General Hospital, Datong, 037003, Shanxi, China.
Whole slide imaging (WSI) has transformed diagnostic medicine, particularly in the field of cancer diagnosis and treatment. The use of deep learning algorithms for predicting WSIs has opened up new avenues for advanced medical diagnostics. Additionally, stain normalization can reduce the color and intensity variations present in WSI from different hospitals.
View Article and Find Full Text PDFScience
January 2025
Department of Electrical, Computer and Energy Engineering, University of Colorado Boulder, Boulder, CO, USA.
Optical frequency combs have enabled unique advantages in broadband, high-resolution spectroscopy and precision interferometry. However, quantum mechanics ultimately limits the metrological precision achievable with laser frequency combs. Quantum squeezing has led to significant measurement improvements with continuous wave lasers, but experiments demonstrating metrological advantage with squeezed combs are less developed.
View Article and Find Full Text PDFBioinformatics
January 2025
Department of Pathology and Department of Immunobiology, Yale School of Medicine.
Summary: With the increased reliance on multi-omics data for bulk and single cell analyses, the availability of robust approaches to perform unsupervised learning for clustering, visualization, and feature selection is imperative. We introduce nipalsMCIA, an implementation of multiple co-inertia analysis (MCIA) for joint dimensionality reduction that solves the objective function using an extension to Non-linear Iterative Partial Least Squares (NIPALS). We applied nipalsMCIA to both bulk and single cell datasets and observed significant speed-up over other implementations for data with a large sample size and/or feature dimension.
View Article and Find Full Text PDFSensors (Basel)
December 2024
School of Computing and Digital Technologies, Sheffield Hallam University, Sheffield S1 1WB, UK.
Prototyping using multi-FPGA platforms is unique because of its use in real-world testing and cycle-accurate information on the design. However, this is a complex and time-consuming process with multiple sub-steps. Among its sub-steps, inter-FPGA routing is the one that can take a significant percentage of total prototyping time.
View Article and Find Full Text PDFBioinformatics
December 2024
Infectious Disease and Microbiome Program, Broad Institute of MIT and Harvard, Cambridge, MA 02142, United States.
Motivation: Partial order alignment is a widely used method for computing multiple sequence alignments, with applications in genome assembly and pangenomics, among many others. Current algorithms to compute the optimal, gap-affine partial order alignment do not scale well to larger graphs and sequences. While heuristic approaches exist, they do not guarantee optimal alignment and sacrifice alignment accuracy.
View Article and Find Full Text PDFEnter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!