Accurate prediction of inter-protein residue–residue contacts for homo-oligomeric protein complexes
Open accessThe DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Abstract
Protein–protein interactions play a fundamental role in all cellular processes. Therefore, determining the structure of protein–protein complexes is crucial to understand their molecular mechanisms and develop drugs targeting the protein–protein interactions. Recently, deep learning has led to a breakthrough in intra-protein contact prediction, achieving an unusual high accuracy in recent Critical Assessment of protein Structure Prediction (CASP) structure prediction challenges. However, due to the limited number of known homologous protein–protein interactions and the challenge to generate joint multiple sequence alignments of two interacting proteins, the advances in inter-protein contact prediction remain limited. Here, we have proposed a deep learning model to predict inter-protein residue–residue contacts across homo-oligomeric protein interfaces, named as DeepHomo. Unlike previous deep learning approaches, we integrated intra-protein distance map and inter-protein docking pattern, in addition to evolutionary coupling, sequence conservation, and physico-chemical information of monomers. DeepHomo was extensively tested on both experimentally determined structures and realistic CASP-Critical Assessment of Predicted Interaction (CAPRI) targets. It was shown that DeepHomo achieved a high precision of >60% for the top predicted contact and outperformed state-of-the-art direct-coupling analysis and machine learning-based approaches. Integrating predicted inter-chain contacts into protein–protein docking significantly improved the docking accuracy on the benchmark dataset of realistic homo-dimeric targets from CASP-CAPRI experiments. DeepHomo is available at http://huanglab.phys.hust.edu.cn/DeepHomo/
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
Deep Residual Learning for Image Recognition
He, K., Zhang, X., Ren, S., & Sun, J. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.90 · Cited by 235,474
Adam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946
The I-TASSER Suite: protein structure and function prediction
Yang, J., Yan, R., Roy, A., Xu, D., Poisson, J., & Zhang, Y. (2015) · Nature Methods · doi:10.1038/nmeth.3213 · Cited by 5,596 · cited 2×
“To be consistent with the blind prediction challenge in CASP,we have used the top Zhang-Server model,which has been blindly predicted by the I-TASSRER server from the Zhang group [53, 54], as the monomer structure for the input of DeepHomo during the evaluation.”
BackgroundMethodMMseqs2 enables sensitive protein sequence searching for the analysis of massive data sets
Steinegger, M., & Söding, J. (2017) · Nature Biotechnology · doi:10.1038/nbt.3988 · Cited by 4,840
TM-align: a protein structure alignment algorithm based on the TM-score
Zhang, Y. (2005) · Nucleic Acids Research · doi:10.1093/nar/gki524 · Cited by 3,774
Improved protein structure prediction using potentials from deep learning
Senior, A. W., Evans, R., Jumper, J., Kirkpatrick, J., Sifre, L., Green, T., Qin, C., Žídek, A., Nelson, A. W. R., Bridgland, A., et al. (2020) · Nature · doi:10.1038/s41586-019-1923-7 · Cited by 3,378
HHblits: lightning-fast iterative protein sequence searching by HMM-HMM alignment
Remmert, M., Biegert, A., Hauser, A., & Söding, J. (2012) · Nature Methods · doi:10.1038/nmeth.1818 · Cited by 2,288
Morcos, F., Pagnani, A., Lunt, B., Bertolino, A., Marks, D. S., Sander, C., Zecchina, R., Onuchic, J. N., Hwa, T., & Weigt, M. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1111471108 · Cited by 1,434
The Cell as a Collection of Protein Machines: Preparing the Next Generation of Molecular Biologists
Alberts, B. (1998) · Cell · doi:10.1016/s0092-8674(00)80922-8 · Cited by 1,411
How significant is a protein structure similarity with TM-score = 0.5?
Xu, J., & Zhang, Y. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btq066 · Cited by 1,142 · cited 3×
“All targets with TM-score 0.5 were merged in one interval [62].”
MethodInfluential
Cited by
Enhancing alphafold-multimer-based protein complex structure prediction with MULTICOM in CASP15
Liu, J., Guo, Z., Wu, T., Roy, R. S., Quadir, F., Chen, C., & Cheng, J. (2023) · Communications Biology · doi:10.1038/s42003-023-05525-3 · Cited by 86
Deep graph learning of inter-protein contacts
Xie, Z., & Xu, J. (2022) · Bioinformatics · doi:10.1093/bioinformatics/btab761 · Cited by 67
(2022) · doi:10.1038/s41467-022-34600-2 · Cited by 57
Roy, R. S., Quadir, F., Soltanikazemi, E., & Cheng, J. (2022) · Bioinformatics · doi:10.1093/bioinformatics/btac063 · Cited by 45
Protein sequence‐to‐structure learning: Is this the end(‐to‐end revolution)?
Laine, E., Eismann, S., Elofsson, A., & Grudinin, S. (2021) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.26235 · Cited by 44
Metadata
- Authors
- Yan, Y., & Huang, S.-Y.
- Venue
- Briefings in Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2021-03-05
- Volume
- 22
- Issue
- 5
- ISSN
- 1467-5463 (ISSN-L)
- 1477-4054
- OpenAlex
- W3133540795
- Cited by
- 69
- References
- 22
- FWCI
- 3.56
- 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: Accurate prediction of inter-protein residue–residue contacts for homo-oligomeric protein complexes. https://app.cochat.ai/papers/10.1093/bib/bbab038
- The paper
- Yan, Y., & Huang, S.-Y. (2021). Accurate prediction of inter-protein residue–residue contacts for homo-oligomeric protein complexes. Briefings in Bioinformatics. https://doi.org/10.1093/bib/bbab038
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.