A tractable genotype–phenotype map modelling the self-assembly of protein quaternary structure
Open accessThe DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
The mapping between biological genotypes and phenotypes is central to the study of biological evolution. Here, we introduce a rich, intuitive and biologically realistic genotype–phenotype (GP) map that serves as a model of self-assembling biological structures, such as protein complexes, and remains computationally and analytically tractable. Our GP map arises naturally from the self-assembly of polyomino structures on a two-dimensional lattice and exhibits a number of properties:redundancy(genotypes vastly outnumber phenotypes),phenotype bias(genotypic redundancy varies greatly between phenotypes),genotype component disconnectivity(phenotypes consist of disconnected mutational networks) and shape space covering(most phenotypes can be reached in a small number of mutations). We also show that the mutational robustness of phenotypes scales very roughly logarithmically with phenotype redundancy and is positively correlated with phenotypic evolvability. Although our GP map describes the assembly of disconnected objects, it shares many properties with other popular GP maps for connected units, such as models for RNA secondary structure or the hydrophobic-polar (HP) lattice model for protein tertiary structure. The remarkable fact that these important properties similarly emerge from such different models suggests the possibility that universal features underlie a much wider class of biologically realistic GP maps.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Kirschner, M., & Gerhart, J. (1998) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.95.15.8420 · Cited by 1,129
The structural basis of the activation of Ras by Sos
Boriack-Sjodin, P. A., Margarit, S. M., Bar-Sagi, D., & Kuriyan, J. (1998) · Nature · doi:10.1038/28548 · Cited by 799 · cited 1×
“Finally in row ( c ), we show a protein complex (PDB reference 1BKD [24]) alongside a polyomino representation.”
BackgroundRobustness and evolvability: a paradox resolved
Wagner, A. (2008) · Proceedings of the Royal Society B: Biological Sciences · doi:10.1098/rspb.2007.1137 · Cited by 669 · cited 5×
“In our work here, we simply consider whether the static properties of the Polyomino GP map behave in a similar manner to those of the RNA GP map as demonstrated by Wagner [30] without here commenting on the wider debate of how robustness and evolvability relate.”
BackgroundResultInfluentialRobustness can evolve gradually in complex regulatory gene networks with varying topology
Ciliberti, S., Martin, O. C., & Wagner, A. (2007) · PLoS Computational Biology · doi:10.1371/journal.pcbi.0030015 · Cited by 390 · cited 1×
“It is therefore not surprising that such redundancy (also known in the literature on GP maps as degeneracy/designability) has been observed in model RNA [9], HP lattice protein [13] and genetic regulatory [39] GP maps, as well as in more general model systems such as signalling networks [40].”
BackgroundMutational robustness can facilitate adaptation
Draghi, J. A., Parsons, T. L., Wagner, G. P., & Plotkin, J. B. (2010) · Nature · doi:10.1038/nature08694 · Cited by 336
From genes to phenotype: dynamical systems and evolvability
Alberch, P. (1991) · Genetica · doi:10.1007/bf00123979 · Cited by 300 · cited 2×
“While organismal genotypes are becoming accessible owing to rapid advances in sequencing technology, further understanding of the complicated mapping from sequence to phenotype is necessary for a richer understanding of evolutionary dynamics [1–4].”
BackgroundEvolution favors protein mutational robustness in sufficiently large populations
Bloom, J. D., Lu, Z., Chen, D., Raval, A., Venturelli, O. S., & Arnold, F. H. (2007) · BMC Biology · doi:10.1186/1741-7007-5-29 · Cited by 119
An End to Endless Forms: Epistasis, Phenotype Distribution Bias, and Nonuniform Evolution
Borenstein, E., & Krakauer, D. C. (2008) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000202 · Cited by 55 · cited 1×
“Pheno-type bias has been observed in models for gene-regulatory networks [54] and developmental networks [55].”
Background
Cited by
Manrubia, S., Cuesta, J. A., Aguirre, J., Ahnert, S. E., Altenberg, L., Cano, A. V., Catalán, P., Diaz-Uriarte, R., Elena, S. F., García-Martín, J. A., et al. (2021) · Physics of Life Reviews · doi:10.1016/j.plrev.2021.03.004 · Cited by 88
Self-citationOn the networked architecture of genotype spaces and its critical effects on molecular evolution
Aguirre, J., Catalán, P., Cuesta, J. A., & Manrubia, S. (2018) · Open Biology · doi:10.1098/rsob.180069 · Cited by 44
Predicting phenotype transition probabilities via conditional algorithmic probability approximations
Dingle, K., Novev, J. K., Ahnert, S. E., & Louis, A. A. (2022) · Journal of the Royal Society Interface · doi:10.1098/rsif.2022.0694 · Cited by 13
Self-citationPredicting phenotype transition probabilities via conditional algorithmic probability approximations
Dingle, K., Novev, J. K., Ahnert, S. E., & Louis, A. A. (2022) · doi:10.1101/2022.09.21.508902 · Cited by 13
Self-citation
Metadata
- Authors
- Greenbury, S. F., Johnston, I. G., Louis, A. A., & Ahnert, S. E.
- Venue
- Journal of The Royal Society Interface
- Publisher
- The Royal Society
- Published
- 2014-06-06
- Volume
- 11
- Issue
- 95
- Pages
- 20140249
- ISSN
- 1742-5662 (ISSN-L)
- 1742-5689
- OpenAlex
- W2129630463
- Cited by
- 65
- References
- 8
- FWCI
- 3.76
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.