Bounding phenotype transition probabilities via conditional complexity

Journal article

By linking genetic sequences to phenotypic traits, genotype–phenotype maps represent a key layer in biological organization. Their structure modulates the effects of genetic mutations which can contribute to shaping evolutionary outcomes. Recent work based on algorithmic information theory introduced an upper bound on the likelihood of a random genetic mutation causing a transition between two phenotypes, using only the conditional complexity between them. Here we evaluate how well this bound works for a range of genotype–phenotype maps, including a differential equation model for circadian rhythm, a matrix-multiplication model of gene regulatory networks, a developmental model of tooth morphologies for ringed seals, a polyomino-tile shape model of biological self-assembly, and the hydrophobic/polar (HP) lattice protein model. By assessing three levels of predictive performance, we find that the bound provides meaningful estimates of phenotype transition probabilities across these complex systems. These results suggest that transition probabilities can be predicted to some degree directly from the phenotypes themselves, without needing detailed knowledge of the underlying genotype–phenotype map.

Authors: Dingle, K; Hagolani, P; Zimm, R; Umar, M; O'Sullivan, S

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: The Royal Society
• Journal: Journal of the Royal Society Interface
• Volume: 22
• Issue: 231
• Pages: 20240916
• Article number: 20240916
• Publication date: 2025-10-08
• Acceptance date: 2025-07-18
• DOI: 10.1098/rsif.2024.0916
• EISSN: 1742-5662
• ISSN: 1742-5689
• Language: English
• Keywords: algorithmic probability; simplicity bias; biological evolution; Kolmogorov complexity; genotype–phenotype maps; prediction