The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
New additions to the ClusPro server motivated by CAPRI
Open accessAbstract
The heavily used protein–protein docking server ClusPro performs three computational steps as follows: (1) rigid body docking, (2) RMSD based clustering of the 1000 lowest energy structures, and (3) the removal of steric clashes by energy minimization. In response to challenges encountered in recent CAPRI targets, we added three new options to ClusPro. These are (1) accounting for small angle X‐ray scattering data in docking; (2) considering pairwise interaction data as restraints; and (3) enabling discrimination between biological and crystallographic dimers. In addition, we have developed an extremely fast docking algorithm based on 5D rotational manifold FFT, and an algorithm for docking flexible peptides that include known sequence motifs. We feel that these developments will further improve the utility of ClusPro. However, CAPRI emphasized several shortcomings of the current server, including the problem of selecting the right energy parameters among the five options provided, and the problem of selecting the best models among the 10 generated for each parameter set. In addition, results convinced us that further development is needed for docking homology models. Finally, we discuss the difficulties we have encountered when attempting to develop a refinement algorithm that would be computationally efficient enough for inclusion in a heavily used server. Proteins 2017; 85:435–444. © 2016 Wiley Periodicals, Inc.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Inference of Macromolecular Assemblies from Crystalline State
Krissinel, E., & Henrick, K. (2007) · Journal of Molecular Biology · doi:10.1016/j.jmb.2007.05.022 · Cited by 9,984
Modeller: Generation and Refinement of Homology-Based Protein Structure Models
Fiser, A., & Šali, A. (2003) · Methods in Enzymology · doi:10.1016/s0076-6879(03)74020-8 · Cited by 1,697
The HADDOCK web server for data-driven biomolecular docking
de Vries, S. J., van Dijk, M., & Bonvin, A. M. J. J. (2010) · Nature Protocols · doi:10.1038/nprot.2010.32 · Cited by 1,400
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
PIPER: An FFT‐based protein docking program with pairwise potentials
Kozakov, D., Brenke, R., Comeau, S. R., & Vajda, S. (2006) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.21117 · Cited by 865
Self-citationClusPro: an automated docking and discrimination method for the prediction of protein complexes
Comeau, S. R., Gatchell, D. W., Vajda, S., & Camacho, C. J. (2004) · Bioinformatics · doi:10.1093/bioinformatics/btg371 · Cited by 855
Self-citationClusPro: a fully automated algorithm for protein-protein docking
Comeau, S. R., Gatchell, D. W., Vajda, S., & Camacho, C. J. (2004) · Nucleic Acids Research · doi:10.1093/nar/gkh354 · Cited by 824
Self-citationHow good is automated protein docking?
Kozakov, D., Beglov, D., Bohnuud, T., Mottarella, S. E., Xia, B., Hall, D. R., & Vajda, S. (2013) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.24403 · Cited by 750
Self-citationProtein–protein docking benchmark version 4.0
Hwang, H., Vreven, T., Janin, J., & Weng, Z. (2010) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.22830 · Cited by 476
Rosetta FlexPepDock web server—high resolution modeling of peptide–protein interactions
London, N., Raveh, B., Cohen, E., Fathi, G., & Schueler-Furman, O. (2011) · Nucleic Acids Research · doi:10.1093/nar/gkr431 · Cited by 402
Cited by
Arshad, N., Laurent-Rolle, M., Ahmed, W. S., Hsu, J. C.-C., Mitchell, S. M., Pawlak, J., Sengupta, D., Biswas, K. H., & Cresswell, P. (2023) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2208525120 · Cited by 119
PepNN: a deep attention model for the identification of peptide binding sites
Abdin, O., Nim, S., Wen, H., & Kim, P. M. (2022) · Communications Biology · doi:10.1038/s42003-022-03445-2 · Cited by 104
von Scheidt, M., Zhao, Y., de Aguiar Vallim, T. Q., Che, N., Wierer, M., Seldin, M. M., Franzén, O., Kurt, Z., Pang, S., Bongiovanni, D., et al. (2021) · Circulation · doi:10.1161/circulationaha.120.050186 · Cited by 68
In Silico Modeling and Scoring of PROTAC-Mediated Ternary Complex Poses
Liao, J., Nie, X., Unarta, I. C., Ericksen, S. S., & Tang, W. (2022) · Journal of Medicinal Chemistry · doi:10.1021/acs.jmedchem.1c02155 · Cited by 62
Improved prediction of MHC-peptide binding using protein language models
Hashemi, N., Hao, B., Ignatov, M., Paschalidis, I. C., Vakili, P., Vajda, S., & Kozakov, D. (2023) · Frontiers in Bioinformatics · doi:10.3389/fbinf.2023.1207380 · Cited by 25
Self-citationGomes, D. E. B., Yang, B., Vanella, R., Nash, M. A., & Bernardi, R. C. (2024) · Journal of the American Chemical Society · doi:10.1021/jacs.4c05869 · Cited by 18
PRMT4 interacts with NCOA4 to inhibit ferritinophagy in cisplatin‐induced acute kidney injury
Zhou, L., Deng, Z., Wang, Y., Zhang, H., Yan, S., Kanwar, Y. S., Wang, Y., Dai, Y., & Deng, F. (2024) · The FASEB Journal · doi:10.1096/fj.202302596r · Cited by 16
Fernández, I., Dynesen, L. T., Coquin, Y., Pederzoli, R., Brun, D., Haouz, A., Gessain, A., Rey, F. A., Buseyne, F., & Backovic, M. (2023) · Nature Communications · doi:10.1038/s41467-023-36923-0 · Cited by 11
Computational Procedure for Predicting Excipient Effects on Protein–Protein Affinities
Dignon, G. L., & Dill, K. A. (2024) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.3c01197 · Cited by 5
(2023) · doi:10.1080/10985549.2023.2273193 · Cited by 5
Mutant KRAS Suppresses DNA Sensing by Remodeling Membrane Tension to Clear Extracellular Tumor DNA
Cao, D., Zhou, W., Li, Z., Lu, S., Hou, Z., Yu, L., Guan, Y., Wang, G., Liu, Y., Huang, Z., et al. (2026) · Cancer Research · doi:10.1158/0008-5472.can-25-4447
Metadata
- Authors
- Vajda, S., Yueh, C., Beglov, D., Bohnuud, T., Mottarella, S. E., Xia, B., Hall, D. R., & Kozakov, D.
- Venue
- Proteins: Structure, Function, and Bioinformatics
- Publisher
- Wiley
- Published
- 2017-01-05
- Volume
- 85
- Issue
- 3
- Pages
- 435-444
- ISSN
- 0887-3585 (ISSN-L)
- 1097-0134
- OpenAlex
- W2561826764
- Cited by
- 604
- References
- 41
- FWCI
- 2.86
- 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.