Predicting discrete traits in evolving systems
Discrete data are prevalent across biology, from nucleotide base pairs to mating systems or petal count on a flower. Predictions using discrete data are central to imputation, forecasting, and hypothesis testing in biology. How much accuracy and confidence they deliver together, and how this varies across scenarios and taxa, has not been quantified systematically. Here, using accuracy and log loss, we benchmark these models across scenarios varying in tree size, evolutionary rate, and trait coevolution. Against non-phylogenetic baselines, they increase accuracy by 23 percentage points and lower log loss by 92% on average; different Markov implementations perform similarly. Log loss rises as terminal branch lengths elongate, a direct consequence of the Markov process. Last, we provide a tutorial and empirical demonstration for the evolution of unexpected character states (outliers). Our study provides a framework for imputing missing data, reconstructing ancestral traits, and testing evolutionary hypotheses.
Authors
- Kevin Surya (ORCID: https://orcid.org/0000-0003-1536-5929)
- Emerald Bender
- Andrew Meade (ORCID: https://orcid.org/0000-0001-7095-7711)
- Chris L. Organ (ORCID: https://orcid.org/0000-0002-2814-2217)
- Liam Feigin
- Jack Prall
Institutions
- Montana State University (US)
- University of Reading (GB)
- University of Edinburgh (GB)
Publication Details
- Journal
- Communications Biology
- Published
- 2026-11-03
- DOI
- https://doi.org/10.1038/s42003-026-11259-9
- Primary Topic
- Evolution and Paleontology Studies
- Type
- article
- Field-Weighted Citation Impact
- 0.00