Predicting phenotype transition probabilities via conditional algorithmic probability approximations

Unravelling the structure of genotype–phenotype (GP) maps is an important problem in biology. Recently, arguments inspired by algorithmic information theory (AIT) and Kolmogorov complexity have been invoked to uncover simplicity bias in GP maps, an exponentially decaying upper bound in phenotype pro...

Descripción completa

Detalles Bibliográficos
Autores principales: Dingle, Kamaludin, Novev, Javor K., Ahnert, Sebastian E., Louis, Ard A.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: The Royal Society 2022
Materias:
Life Sciences–Mathematics interface
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9748496/
https://www.ncbi.nlm.nih.gov/pubmed/36514888
http://dx.doi.org/10.1098/rsif.2022.0694

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9748496/
https://www.ncbi.nlm.nih.gov/pubmed/36514888
http://dx.doi.org/10.1098/rsif.2022.0694

Ejemplares similares