Characterization of Protein Hubs by Inferring Interacting Motifs from Protein Interactions
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
The characterization of protein interactions is essential for understanding biological systems. While genome-scale methods are available for identifying interacting proteins, they do not pinpoint the interacting motifs (e.g., a domain, sequence segments, a binding site, or a set of residues). Here, we develop and apply a method for delineating the interacting motifs of hub proteins (i.e., highly connected proteins). The method relies on the observation that proteins with common interaction partners tend to interact with these partners through a common interacting motif. The sole input for the method are binary protein interactions; neither sequence nor structure information is needed. The approach is evaluated by comparing the inferred interacting motifs with domain families defined for 368 proteins in the Structural Classification of Proteins (SCOP). The positive predictive value of the method for detecting proteins with common SCOP families is 75% at sensitivity of 10%. Most of the inferred interacting motifs were significantly associated with sequence patterns, which could be responsible for the common interactions. We find that yeast hubs with multiple interacting motifs are more likely to be essential than hubs with one or two interacting motifs, thus rationalizing the previously observed correlation between essentiality and the number of interacting partners of a protein. We also find that yeast hubs with multiple interacting motifs evolve slower than the average protein, contrary to the hubs with one or two interacting motifs. The proposed method will help us discover unknown interacting motifs and provide biological insights about protein hubs and their roles in interaction networks.
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
The Database of Interacting Proteins: 2004 update
Salwinski, L. (2004) · Nucleic Acids Research · doi:10.1093/nar/gkh086 · Cited by 2,271
Evolutionary Rate in the Protein Interaction Network
Fraser, H. B., Hirsh, A. E., Steinmetz, L. M., Scharfe, C., & Feldman, M. W. (2002) · Science · doi:10.1126/science.1068696 · Cited by 869
Systematic Discovery of New Recognition Peptides Mediating Protein Interaction Networks
Neduva, V., Linding, R., Su-Angrand, I., Stark, A., Masi, F. D., Gibson, T. J., Lewis, J., Serrano, L., & Russell, R. B. (2005) · PLoS Biology · doi:10.1371/journal.pbio.0030405 · Cited by 359 · cited 1×
“…and an iMotif was assessed using the binomial distribution, based on the occurrence of the pattern inside the iMotif with respect the whole dataset [60]: where M is the number of protein sequences within an iMotif, n represents the number of proteins within the iMotif that contain the sequence…”
Method
Cited by
Continuous Distributed Representation of Biological Sequences for Deep Proteomics and Genomics
Asgari, E., & Mofrad, M. R. K. (2015) · PLOS ONE · doi:10.1371/journal.pone.0141287 · Cited by 821
Nonspecific Binding—Fundamental Concepts and Consequences for Biosensing Applications
Frutiger, A., Tanno, A., Hwu, S., Tiefenauer, R. F., Vörös, J., & Nakatsuka, N. (2021) · Chemical Reviews · doi:10.1021/acs.chemrev.1c00044 · Cited by 278
Human Cancer Protein-Protein Interaction Network: A Structural Perspective
Kar, G., Gursoy, A., & Keskin, O. (2009) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000601 · Cited by 235
Deep Learning in Protein Structural Modeling and Design
Gao, W., Mahajan, S. P., Sulam, J., & Gray, J. J. (2020) · Patterns · doi:10.1016/j.patter.2020.100142 · Cited by 227
Protein–protein interaction networks: how can a hub protein bind so many different partners?
Tsai, C.-J., Ma, B., & Nussinov, R. (2009) · Trends in Biochemical Sciences · doi:10.1016/j.tibs.2009.07.007 · Cited by 138
Metadata
- Authors
- Aragues, R., Sali, A., Bonet, J., Marti-Renom, M. A., & Oliva, B.
- Venue
- PLoS Computational Biology
- Publisher
- Public Library of Science (PLoS)
- Published
- 2007-09-14
- Volume
- 3
- Issue
- 9
- Pages
- e178
- ISSN
- 1553-734X (ISSN-L)
- 1553-7358
- OpenAlex
- W2039465881
- Cited by
- 53
- References
- 3
- FWCI
- 1.92
- 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.