Bounding phenotype transition probabilities via conditional complexity
Journal of The Royal Society Interface The Royal Society 22:231 (2025) 20240916
Abstract:
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.Feature learning is decoupled from generalization in high capacity neural networks
(2025)
Controlling DNA鈥揜NA strand displacement kinetics with base distribution
Proceedings of the National Academy of Sciences National Academy of Sciences 122:23 (2025) e2416988122
Abstract:
Characterising the Inductive Biases of Neural Networks on Boolean Data
(2025)
Deep neural networks have an inbuilt Occam鈥檚 razor
Nature Communications Nature Research 16:1 (2025) 220