PAIRpred: Partner‐specific prediction of interacting residues from sequence and structure
Open accessThe DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
We present a novel partner‐specific protein–protein interaction site prediction method called PAIRpred. Unlike most existing machine learning binding site prediction methods, PAIRpred uses information from both proteins in a protein complex to predict pairs of interacting residues from the two proteins. PAIRpred captures sequence and structure information about residue pairs through pairwise kernels that are used for training a support vector machine classifier. As a result, PAIRpred presents a more detailed model of protein binding, and offers state of the art accuracy in predicting binding sites at the protein level as well as inter‐protein residue contacts at the complex level. We demonstrate PAIRpred's performance on Docking Benchmark 4.0 and recent CAPRI targets. We present a detailed performance analysis outlining the contribution of different sequence and structure features, together with a comparison to a variety of existing interface prediction techniques. We have also studied the impact of binding‐associated conformational change on prediction accuracy and found PAIRpred to be more robust to such structural changes than existing schemes. As an illustration of the potential applications of PAIRpred, we provide a case study in which PAIRpred is used to analyze the nature and specificity of the interface in the interaction of human ISG15 protein with NS1 protein from influenza A virus. Python code for PAIRpred is available at http://combi.cs.colostate.edu/supplements/pairpred/. Proteins 2014; 82:1142–1155. © 2013 Wiley Periodicals, Inc.
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
Cortes, C., & Vapnik, V. (1995) · Machine Learning · doi:10.1007/bf00994018 · Cited by 59,421
Biopython: freely available python tools for computational molecular biology and bioinformatics
Cock, P. J. A., Antao, T., Chang, J. T., Chapman, B. A., Cox, C. J., Dalke, A., Friedberg, I., Hamelryck, T., Kauff, F., Wilczynski, B., et al. (2009) · Bioinformatics · doi:10.1093/bioinformatics/btp163 · Cited by 6,080
Protein 3D Structure Computed from Evolutionary Sequence Variation
Marks, D. S., Colwell, L. J., Sheridan, R., Hopf, T. A., Pagnani, A., Zecchina, R., & Sander, C. (2011) · PLoS ONE · doi:10.1371/journal.pone.0028766 · Cited by 1,144 · cited 1×
“In the future we plan on adding features to capture shape complementarity between binding interfaces, information about correlated mutations, 52,53 protein flexibility and predictors of degree of conformational change54 in order to improve the predictions even further.”
Principles of Protein−Protein Interactions: What are the Preferred Ways For Proteins To Interact?
Keskin, O., Gursoy, A., Ma, B., & Nussinov, R. (2008) · Chemical Reviews · doi:10.1021/cr040409x · Cited by 697
Docking and scoring protein interactions: CAPRI 2009
Lensink, M. F., & Wodak, S. J. (2010) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.22818 · Cited by 226
Templates are available to model nearly all complexes of structurally characterized proteins
Kundrotas, P. J., Zhu, Z., Janin, J., & Vakser, I. A. (2012) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1200678109 · Cited by 179 · cited 1×
“The docking problem has been extensively investigated using a large variety of strategies such as Fast Fourier Transform [10,11], geometric hashing [12, 13], Monte-Carlo search [14] and template matching [15].”
Method
Cited by
Protein interface prediction using graph convolutional networks
Fout, A., Ben‐Hur, A., Anderson, C., Chitsaz, H., & Zhou, W. (2017) · Digital Collections of Colorado (Colorado State University) · doi:10.25675/3.021826 · Cited by 513
Self-citationPredicting Protein–Protein Interactions from the Molecular to the Proteome Level
Keskin, O., Tuncbag, N., & Gursoy, A. (2016) · Chemical Reviews · doi:10.1021/acs.chemrev.5b00683 · Cited by 369
Brown, A. J., Snapkov, I., Akbar, R., Pavlović, M., Miho, E., Sandve, G. K., & Greiff, V. (2019) · Molecular Systems Design & Engineering · doi:10.1039/c9me00071b · Cited by 59
Deep Learning of High-Order Interactions for Protein Interface Prediction
Liu, Y., Yuan, H., Cai, L., & Ji, S. (2020) · Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3394486.3403110 · Cited by 48
“Partner-specific prediction has been demonstrated to achieve better performance due to the use of interaction information in protein complexes [1, 2].”
BackgroundMethodInfluentialArtificial intelligence approaches to human-microbiome protein–protein interactions
Lim, H., Cankara, F., Tsai, C.-J., Keskin, O., Nussinov, R., & Gursoy, A. (2022) · Current Opinion in Structural Biology · doi:10.1016/j.sbi.2022.102328 · Cited by 39
Metadata
- Authors
- Afsar Minhas, F. U. A., Geiss, B. J., & Ben‐Hur, A.
- Venue
- Proteins: Structure, Function, and Bioinformatics
- Publisher
- Wiley
- Published
- 2013-12-06
- Volume
- 82
- Issue
- 7
- Pages
- 1142-1155
- ISSN
- 0887-3585 (ISSN-L)
- 1097-0134
- OpenAlex
- W2127771490
- Cited by
- 126
- References
- 6
- FWCI
- 1.48
- Type
- journal article
- Language
- en
- Open access
- green
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.