Pythia 2.0: New Data, New Prediction Model, New Features
Abstract
Maximum Likelihood (ML) based phylogenetic inference is time- and resource-intensive, especially when initiating multiple independent inferences from distinct comprehensive tree topologies. Performing multiple independent inferences is often required to (sufficiently) explore the vast search space of possible unrooted binary tree topologies. Yet, these independent inferences do not necessarily converge to a single phylogeny or at least topologically highly similar trees. While for easy-to-analyze multiple sequence alignments (MSAs), one is likely to obtain a conclusive, single phylogeny, difficult-to-analyze MSAs yield topologically highly distinct, yet statistically indistinguishable tree topologies. In 2022, we proposed a compute-intensive approach to quantify the inherent difficulty of a phylogenetic analysis for a specific, given MSA, and also trained a machine-learning based prediction model called Pythia to substantially reduce the computational cost of determining the difficulty. Pythia can predict the difficulty for a given MSA with high accuracy, while being substantially faster than even a single ML tree inference. Pythia predicts the difficulty on a scale from 0 (easy) to 1 (difficult). Here, we present all improvements to Pythia that we have introduced since our initial publication in 2022. We trained a new prediction model using approximately three times more MSAs and a new type of machine learning model. We improved the runtime of two feature computations, and we also introduced two additional prediction features. Our latest version Pythia 2.0 is slightly more accurate than our initial version and is also approximately twice as fast. Finally, we also present and make available, the novel and easy-to-use command line tool PyDLG that allows to compute the ground-truth difficulty seamlessly for a given MSA. This ground-truth difficulty can be used, for instance, as a prediction target for training a new Pythia model.
02 /Specification & Classification
Click any tag to browse matching papers- Citations
- 3
- Assay
- Research Focus
- Approach
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- From Easy to Hopeless - Predicting the Difficulty of Phylogenetic Analyses
Julia Haag, Dimitri Höhler, … Alexandros Stamatakis·Molecular Biology and EvolutionPeer-reviewed·Nov 17, 2022
- Adaptive RAxML-NG: Accelerating Phylogenetic inference under Maximum Likelihood using dataset difficulty
Anastasis Togkousidis, Oleksiy M. Kozlov, … Alexandros Stamatakis·Molecular Biology and EvolutionPeer-reviewed·Oct 1, 2023
- phyddle: software for exploring phylogenetic models with deep learning
Michael J. Landis, Ammon Thompson·Systematic BiologyPeer-reviewed·May 14, 2025
- Phyloformer: Fast, accurate and versatile phylogenetic reconstruction with deep neural networks
Luca Nesterenko, Luc Blassel, … Laurent Jacob·Molecular Biology and EvolutionPeer-reviewed·Mar 10, 2025
- Reliable estimation of tree branch lengths using deep neural networks
A. Suvorov, D. Schrider·PLOS Computational BiologyPeer-reviewed·Aug 5, 2024
- TreePPL: A Universal Probabilistic Programming Language for Phylogenetics
Viktor Senderov, Jan Kudlicka, … Fredrik Ronquist·bioRxiv·Oct 10, 2023