Grammar of protein domain architectures
Open accessThe DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Abstract
From an abstract, informational perspective, protein domains appear analogous to words in natural languages in which the rules of word association are dictated by linguistic rules, or grammar. Such rules exist for protein domains as well, because only a small fraction of all possible domain combinations is viable in evolution. We employ a popular linguistic technique, n -gram analysis, to probe the “proteome grammar”—that is, the rules of association of domains that generate various domain architectures of proteins. Comparison of the complexity measures of “protein languages” in major branches of life shows that the relative entropy difference (information gain) between the observed domain architectures and random domain combinations is highly conserved in evolution and is close to being a universal constant, at ∼1.2 bits. Substantial deviations from this constant are observed in only two major groups of organisms: a subset of Archaea that appears to be cells simplified to the limit, and animals that display extreme complexity. We also identify the n- grams that represent signatures of the major branches of cellular life. The results of this analysis bolster the analogy between genomes and natural language and show that a “quasi-universal grammar” underlies the evolution of domain architectures in all divisions of cellular life. The nearly universal value of information gain by the domain architectures could reflect the minimum complexity of signal processing that is required to maintain a functioning cell.
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
Accelerated Profile HMM Searches
Eddy, S. R. (2011) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1002195 · Cited by 6,975 · cited 2×
“Complete proteome data from the three superkingdoms of life (Bacteria, Archaea, and Eukaryota — often called domains of cellular life, a term that we do not use here to denote taxa so as to avoid confusion with protein domains), were downloaded from the UniProt (39) database (see Methods and Datasets S1 and S2), and d…”
MethodUniProt: the universal protein knowledgebase
The UniProt Consortium (2017) · Nucleic Acids Research · doi:10.1093/nar/gkw1099 · Cited by 4,436
mixOmics: An R package for ‘omics feature selection and multiple data integration
Rohart, F., Gautier, B., Singh, A., & Lê Cao, K.-A. (2017) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1005752 · Cited by 4,056 · cited 1×
“We used the splsda method from the R package mixOmics (78) and performed feature selection after variable tuning.”
MethodThe Pfam protein families database
Finn, R. D., Mistry, J., Tate, J., Coggill, P., Heger, A., Pollington, J. E., Gavin, O. L., Gunasekaran, P., Ceric, G., Forslund, K., et al. (2010) · Nucleic Acids Research · doi:10.1093/nar/gkp985 · Cited by 2,694 · cited 1×
“…cellular life, a term that we do not use here to denote taxa so as to avoid confusion with protein domains), were downloaded from the UniProt (39) database (see Methods and Datasets S1 and S2), and domains were mapped onto the sequence of each protein using HMMER3 (40) and the Pfam database (41).”
MethodPrediction and Entropy of Printed English
Shannon, C. E. (1951) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1951.tb01366.x · Cited by 2,686
The origins of genome complexity
Lynch, M., & Conery, J. S. (2003) · Science · doi:10.1126/science.1089370 · Cited by 1,698
Unexpected complexity of the Wnt gene family in a sea anemone
Kusserow, A., Pang, K., Sturm, C., Hrouda, M., Lentfer, J., Schmidt, H. A., Technau, U., von Haeseler, A., Hobmayer, B., Martindale, M. Q., et al. (2005) · Nature · doi:10.1038/nature03158 · Cited by 599
Keeling, P. J., Burger, G., Durnford, D. G., Lang, B. F., Lee, R. W., Pearlman, R. E., Roger, A. J., & Gray, M. W. (2005) · Trends in Ecology & Evolution · doi:10.1016/j.tree.2005.09.005 · Cited by 579 · cited 2×
“Depending on the placement of the root, the tree can be interpreted as being compatible with the unikont – bikont topology (74, 75).”
BackgroundMethodHorizontal Transfer, Not Duplication, Drives the Expansion of Protein Families in Prokaryotes
Treangen, T. J., & Rocha, E. P. C. (2011) · PLoS Genetics · doi:10.1371/journal.pgen.1001284 · Cited by 509
The logic of chance: the nature and origin of biological evolution
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3845 · Cited by 391
Cited by
Zhou, X., Zheng, W., Li, Y., Pearce, R., Zhang, C., Bell, E. W., Zhang, G., & Zhang, Y. (2022) · Nature Protocols · doi:10.1038/s41596-022-00728-0 · Cited by 519
The language of proteins: NLP, machine learning & protein sequences
Ofer, D., Brandes, N., & Linial, M. (2021) · Computational and Structural Biotechnology Journal · doi:10.1016/j.csbj.2021.03.022 · Cited by 339
BERTology Meets Biology: Interpreting Attention in Protein Language Models
Vig, J., Madani, A., Varshney, L. R., Xiong, C., Socher, R., & Rajani, N. F. (2020) · doi:10.1101/2020.06.26.174417 · Cited by 338
Li, H.-L., Pang, Y.-H., & Liu, B. (2021) · Nucleic Acids Research · doi:10.1093/nar/gkab829 · Cited by 269
Effect of tokenization on transformers for biological sequences
Dotan, E., Jaschek, G., Pupko, T., & Belinkov, Y. (2024) · Bioinformatics · doi:10.1093/bioinformatics/btae196 · Cited by 49
Metadata
- Authors
- Yu, L., Tanwar, D. K., Penha, E. D. S., Wolf, Y. I., Koonin, E. V., & Basu, M. K.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 2019-02-07
- Volume
- 116
- Issue
- 9
- Pages
- 3636-3645
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W2912459817
- Cited by
- 69
- References
- 12
- FWCI
- 2.79
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Grammar of protein domain architectures. https://app.cochat.ai/papers/10.1073/pnas.1814684116
- The paper
- Yu, L., Tanwar, D. K., Penha, E. D. S., Wolf, Y. I., Koonin, E. V., & Basu, M. K. (2019). Grammar of protein domain architectures. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.1814684116
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.