DNCON2_Inter: predicting interchain contacts for homodimeric and homomultimeric protein complexes using multiple sequence alignments of monomers and deep learning
Open accessThe DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Abstract
Deep learning methods that achieved great success in predicting intrachain residue-residue contacts have been applied to predict interchain contacts between proteins. However, these methods require multiple sequence alignments (MSAs) of a pair of interacting proteins (dimers) as input, which are often difficult to obtain because there are not many known protein complexes available to generate MSAs of sufficient depth for a pair of proteins. In recognizing that multiple sequence alignments of a monomer that forms homomultimers contain the co-evolutionary signals of both intrachain and interchain residue pairs in contact, we applied DNCON2 (a deep learning-based protein intrachain residue-residue contact predictor) to predict both intrachain and interchain contacts for homomultimers using multiple sequence alignment (MSA) and other co-evolutionary features of a single monomer followed by discrimination of interchain and intrachain contacts according to the tertiary structure of the monomer. We name this tool DNCON2_Inter. Allowing true-positive predictions within two residue shifts, the best average precision was obtained for the Top-L/10 predictions of 22.9% for homodimers and 17.0% for higher-order homomultimers. In some instances, especially where interchain contact densities are high, DNCON2_Inter predicted interchain contacts with 100% precision. We also developed Con_Complex, a complex structure reconstruction tool that uses predicted contacts to produce the structure of the complex. Using Con_Complex, we show that the predicted contacts can be used to accurately construct the structure of some complexes. Our experiment demonstrates that monomeric multiple sequence alignments can be used with deep learning to predict interchain contacts of homomeric proteins.
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
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
ZDOCK: An initial‐stage protein‐docking algorithm
Chen, R., Li, L., & Weng, Z. (2003) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.10389 · Cited by 1,393 · cited 2×
“ClusPro computes models with low energy scores and ZDOCK aims to achieve a maximum ZDOCK-score.”
MethodStructural Symmetry and Protein Function
Goodsell, D. S., & Olson, A. J. (2000) · Annual Review of Biophysics and Biomolecular Structure · doi:10.1146/annurev.biophys.29.1.105 · Cited by 950
Accurate De Novo Prediction of Protein Contact Map by Ultra-Deep Learning Model
Wang, S., Sun, S., Li, Z., Zhang, R., & Xu, J. (2017) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1005324 · Cited by 931
Ovchinnikov, S., Kamisetty, H., & Baker, D. (2014) · eLife · doi:10.7554/elife.02030 · Cited by 629 · cited 6×
“Another approach by Baker 23 , in order to determine protein–protein interactions in Escherichia coli and Mycobacterium tuberculosis , selected strongly co-evolving interacting protein pairs from the paired MSA of orthologs based on high values of residue-residue mutual information.”
BackgroundMethodResultInfluentialSequence co-evolution gives 3D contacts and structures of protein complexes
Hopf, T. A., Schärfe, C. P. I., Rodrigues, J. P. G. L. M., Green, A. G., Kohlbacher, O., Sander, C., Bonvin, A. M. J. J., & Marks, D. S. (2014) · eLife · doi:10.7554/elife.03430 · Cited by 515 · cited 1×
“Unlike the previous works of Hopf et al. 3 , Ovchinnikov et al. 19 , Zhou et al. 4 , and Zeng et al. 20 , which requires Table 1.”
ResultProtein interaction networks revealed by proteome coevolution
Cong, Q., Anishchenko, I., Ovchinnikov, S., & Baker, D. (2019) · Science · doi:10.1126/science.aaw6718 · Cited by 241
Assessment of contact predictions in CASP12: Co‐evolution and deep learning coming of age
Schaarschmidt, J., Monastyrskyy, B., Kryshtafovych, A., & Bonvin, A. M. J. J. (2018) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.25407 · Cited by 177 · cited 1×
“Some of these methods have performed well in the 12 and 13 Critical Assessment of Techniques for Protein Structure Prediction (CASP) competitions (Adhikari et al., 2018; Alquraishi & Valencia, 2019; Cheng et al., 2019; J. Hou et al., 2020; Schaarschmidt et al., 2018; Senior et al., 2020; Shrestha, Fajardo, Gil, Fideli…”
Method
Cited by
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
Self-citationFlexible protein–protein docking with a multitrack iterative transformer
Chu, L., Ruffolo, J. A., Harmalkar, A., & Gray, J. J. (2024) · Protein Science · doi:10.1002/pro.4862 · Cited by 41
Limits and potential of combined folding and docking
Pozzati, G., Zhu, W., Bassot, C., Lamb, J., Kundrotas, P., & Elofsson, A. (2022) · Bioinformatics · doi:10.1093/bioinformatics/btab760 · Cited by 25
Metadata
- Authors
- Quadir, F., Roy, R. S., Halfmann, R., & Cheng, J.
- Venue
- Scientific Reports
- Published
- 2021-06-10
- Volume
- 11
- Issue
- 1
- Pages
- 12295-12295
- ISSN
- 2045-2322 (ISSN-L)
- OpenAlex
- W3106340289
- Cited by
- 28
- References
- 9
- FWCI
- 1.54
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: DNCON2_Inter: predicting interchain contacts for homodimeric and homomultimeric protein complexes using multiple sequence alignments of monomers and deep learning. https://app.cochat.ai/papers/10.1038/s41598-021-91827-7
- The paper
- Quadir, F., Roy, R. S., Halfmann, R., & Cheng, J. (2021). DNCON2_Inter: predicting interchain contacts for homodimeric and homomultimeric protein complexes using multiple sequence alignments of monomers and deep learning. Scientific Reports. https://doi.org/10.1038/s41598-021-91827-7
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.