Detecting Coevolution in and among Protein Domains
Open accessThe DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
Correlated changes of nucleic or amino acids have provided strong information about the structures and interactions of molecules. Despite the rich literature in coevolutionary sequence analysis, previous methods often have to trade off between generality, simplicity, phylogenetic information, and specific knowledge about interactions. Furthermore, despite the evidence of coevolution in selected protein families, a comprehensive screening of coevolution among all protein domains is still lacking. We propose an augmented continuous-time Markov process model for sequence coevolution. The model can handle different types of interactions, incorporate phylogenetic information and sequence substitution, has only one extra free parameter, and requires no knowledge about interaction rules. We employ this model to large-scale screenings on the entire protein domain database (Pfam). Strikingly, with 0.1 trillion tests executed, the majority of the inferred coevolving protein domains are functionally related, and the coevolving amino acid residues are spatially coupled. Moreover, many of the coevolving positions are located at functionally important sites of proteins/protein complexes, such as the subunit linkers of superoxide dismutase, the tRNA binding sites of ribosomes, the DNA binding region of RNA polymerase, and the active and ligand binding sites of various enzymes. The results suggest sequence coevolution manifests structural and functional constraints of proteins. The intricate relations between sequence coevolution and various selective constraints are worth pursuing at a deeper level.
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
Controlling the False Discovery Rate: A Practical and Powerful Approach to Multiple Testing
Benjamini, Y., & Hochberg, Y. (1995) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1995.tb02031.x · Cited by 109,482
Evolutionary trees from DNA sequences: A maximum likelihood approach.
Felsenstein, J. (1981) · Journal of Molecular Evolution · doi:10.1007/bf01734359 · Cited by 14,571 · cited 1×
“The marginal likelihoods of singlet and pairwise terms were calculated using Felsenstein’s dynamic programming algorithm [55].”
Method(1994) · Proceedings of the Royal Society of London. Series B: Biological Sciences · doi:10.1098/rspb.1994.0006 · Cited by 1,859
Carter, A. P., Clemons, W. M., Brodersen, D. E., Morgan-Warren, R. J., Wimberly, B. T., & Ramakrishnan, V. (2000) · Nature · doi:10.1038/35030019 · Cited by 1,615
Structural Basis of Transcription: RNA Polymerase II at 2.8 Ångstrom Resolution
Cramer, P., Bushnell, D. A., & Kornberg, R. D. (2001) · Science · doi:10.1126/science.1059493 · Cited by 1,247
Expokit: a software package for computing matrix exponentials
Sidje, R. B. (1998) · ACM Transactions on Mathematical Software · doi:10.1145/285861.285868 · Cited by 781
Korber, B. T., Farber, R. M., Wolpert, D. H., & Lapedes, A. S. (1993) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.90.15.7176 · Cited by 257
Cited by
Emerging methods in protein co-evolution
de Juan, D., Pazos, F., & Valencia, A. (2013) · Nature Reviews Genetics · doi:10.1038/nrg3414 · Cited by 607
CherryML: scalable maximum likelihood estimation of phylogenetic models
Prillo, S., Deng, Y., Boyeau, P., Li, X., Chen, P.-Y., & Song, Y. S. (2023) · Nature Methods · doi:10.1038/s41592-023-01917-9 · Cited by 13
Metadata
- Authors
- Yeang, C.-H., & Haussler, D.
- Venue
- PLoS Computational Biology
- Publisher
- Public Library of Science (PLoS)
- Published
- 2007-11-02
- Volume
- 3
- Issue
- 11
- Pages
- e211
- ISSN
- 1553-734X (ISSN-L)
- 1553-7358
- OpenAlex
- W2116087481
- Cited by
- 165
- References
- 7
- FWCI
- 5.87
- Type
- journal article
- Language
- en
- Open access
- gold
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.