Bit-reproducible parallel phylogenetic tree inference.

ABSTRACT:

Motivation

Phylogenetic trees describe the evolutionary history among biological species based on their genomic data. Maximum likelihood (ML) based phylogenetic inference tools search for the tree and evolutionary model that best explain the observed genomic data. Given the independence of likelihood score calculations between different genomic sites, parallel computation is commonly deployed. This is followed by a parallel summation over the per-site scores to obtain the overall likelihood score of the tree. However, basic arithmetic operations on IEEE 754 floating-point numbers, such as addition and multiplication, inherently introduce rounding errors. Consequently, the order by which floating-point operations are executed affects the exact resulting likelihood value since these

SUBMITTER: Stelz C 

PROVIDER: S-EPMC12904832 | biostudies-literature | 2026 Feb

REPOSITORIES: biostudies-literature