Protein-Protein Interaction Interface Residue Pair Prediction Based on Deep Learning Architecture
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
MOTIVATION: Proteins usually fulfill their biological functions by interacting with other proteins. Although some methods have been developed to predict the binding sites of a monomer protein, these are not sufficient for prediction of the interaction between two monomer proteins. The correct prediction of interface residue pairs from two monomer proteins is still an open question and has great significance for practical experimental applications in the life sciences. We hope to build a method for the prediction of interface residue pairs that is suitable for those applications. RESULTS: Here, we developed a novel deep network architecture called the multi-layered Long-Short Term Memory networks (LSTMs) approach for the prediction of protein interface residue pairs. First, we created three new descriptions and used other six worked characterizations to describe an amino acid, then we employed these features to discriminate between interface residue pairs and non-interface residue pairs. Second, we used two thresholds to select residue pairs that are more likely to be interface residue pairs. Furthermore, this step increases the proportion of interface residue pairs and reduces the influence of imbalanced data. Third, we built deep network architectures based on Long-Short Term Memory networks algorithm to organize and refine the prediction of interface residue pairs by employing features mentioned above. We trained the deep networks on dimers in the unbound state in the international Protein-protein Docking Benchmark version 3.0. The updated data sets in the versions 4.0 and 5.0 were used as the validation set and test set respectively. For our best model, the accuracy rate was over 62 percent when we chose the top 0.2 percent pairs of every dimer in the test set as predictions, which will be very helpful for the understanding of protein-protein interaction mechanisms and for guidance in biological experiments.
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
Hochreiter, S., & Schmidhuber, J. (1997) · Neural Computation · doi:10.1162/neco.1997.9.8.1735 · Cited by 102,318
CAPRI: A Critical Assessment of PRedicted Interactions
Janin, J., Henrick, K., Moult, J., Eyck, L. T., Sternberg, M. J. E., Vajda, S., Vakser, I., & Wodak, S. J. (2003) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.10381 · Cited by 703
Vreven, T., Moal, I. H., Vangone, A., Pierce, B. G., Kastritis, P. L., Torchala, M., Chaleil, R., Jiménez-García, B., Bates, P. A., Fernandez-Recio, J., et al. (2015) · Journal of Molecular Biology · doi:10.1016/j.jmb.2015.07.016 · Cited by 424 · cited 1×
“Because of low homology between proteins from different docking benchmark versions [14], [16], [17], we took dimers in version 3.”
Background
Cited by
(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
Li, S., Wu, S., Wang, L., Li, F., Jiang, H., & Bai, F. (2022) · Current Opinion in Structural Biology · doi:10.1016/j.sbi.2022.102344 · Cited by 42
Metadata
- Authors
- Zhao, Z., & Gong, X.
- Venue
- IEEE/ACM Transactions on Computational Biology and Bioinformatics
- Published
- 2019-09-01
- Volume
- 16
- Issue
- 5
- Pages
- 1753-1759
- ISSN
- 1545-5963 (ISSN-L)
- 1557-9964
- 2374-0043
- OpenAlex
- W2614995786
- Cited by
- 38
- References
- 3
- FWCI
- 1.26
- Type
- journal article
- Language
- en
- Open access
- closed
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.