PepCrawler: a fast RRT-based algorithm for high-resolution refinement and binding affinity estimation of peptide inhibitors
The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
Motivation: Design of protein–protein interaction (PPI) inhibitors is a key challenge in structural bioinformatics and computer-aided drug design. Peptides, which partially mimic the interface area of one of the interacting proteins, are natural candidates to form protein–peptide complexes competing with the original PPI. The prediction of such complexes is especially challenging due to the high flexibility of peptide conformations. Results: In this article, we present PepCrawler, a new tool for deriving binding peptides from protein–protein complexes and prediction of peptide–protein complexes, by performing high-resolution docking refinement and estimation of binding affinity. By using a fast path planning approach, PepCrawler rapidly generates large amounts of flexible peptide conformations, allowing backbone and side chain flexibility. A newly introduced binding energy funnel ‘steepness score’ was applied for the evaluation of the protein–peptide complexes binding affinity. PepCrawler simulations predicted high binding affinity for native protein–peptide complexes benchmark and low affinity for low-energy decoy complexes. In three cases, where wet lab data are available, the PepCrawler predictions were consistent with the data. Comparing to other state of the art flexible peptide–protein structure prediction algorithms, our algorithm is very fast, and takes only minutes to run on a single PC. Availability: http://bioinfo3d.cs.tau.ac.il/PepCrawler/ Contact: eladdons@tau.ac.il; wolfson@tau.ac.il
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
Small-molecule inhibitors of protein–protein interactions: progressing towards the dream
Arkin, M. R., & Wells, J. A. (2004) · Nature Reviews Drug Discovery · doi:10.1038/nrd1343 · Cited by 1,705
Structural basis for the recognition between HIV-1 integrase and transcriptional coactivator p75
Cherepanov, P., Ambrosio, A. L. B., Rahman, S., Ellenberger, T., & Engelman, A. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0506924102 · Cited by 408
Identification of the Critical Features of a Small Peptide Inhibitor of JNK Activity
Barr, R. K., Kendrick, T. S., & Bogoyevitch, M. A. (2002) · Journal of Biological Chemistry · doi:10.1074/jbc.m107565200 · Cited by 211
Arkin, M. R., & Whitty, A. (2009) · Current Opinion in Chemical Biology · doi:10.1016/j.cbpa.2009.05.125 · Cited by 190
Phan, J., Li, Z., Kasprzak, A., Li, B., Sebti, S., Guida, W., Schönbrunn, E., & Chen, J. (2010) · Journal of Biological Chemistry · doi:10.1074/jbc.m109.073056 · Cited by 173
London, N., Raveh, B., Movshovitz‐Attias, D., & Schueler‐Furman, O. (2010) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.22785 · Cited by 164
Cited by
Improved Docking of Polypeptides with Glide
Tubert-Brohman, I., Sherman, W., Repasky, M., & Beuming, T. (2013) · Journal of Chemical Information and Modeling · doi:10.1021/ci400128m · Cited by 1,308
PEP-FOLD3: faster de novo structure prediction for linear peptides in solution and in complex
Lamiable, A., Thévenet, P., Rey, J., Vavrusa, M., Derreumaux, P., & Tufféry, P. (2016) · Nucleic Acids Research · doi:10.1093/nar/gkw329 · Cited by 1,053
A Comprehensive Review on Current Advances in Peptide Drug Development and Design
Lee, A. C.-L., Harris, J. L., Khanna, K. K., & Hong, J.-H. (2019) · International Journal of Molecular Sciences · doi:10.3390/ijms20102383 · Cited by 686
Use of molecular docking computational tools in drug discovery
(2021) · Progress in Medicinal Chemistry · doi:10.1016/bs.pmch.2021.01.004 · Cited by 621
HPEPDOCK: a web server for blind peptide–protein docking based on a hierarchical algorithm
Zhou, P., Jin, B., Li, H., & Huang, S.-Y. (2018) · Nucleic Acids Research · doi:10.1093/nar/gky357 · Cited by 609
Metadata
- Authors
- Donsky, E., & Wolfson, H. J.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2011-08-31
- Volume
- 27
- Issue
- 20
- Pages
- 2836-2842
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2265106521
- Cited by
- 102
- References
- 6
- FWCI
- 1.41
- 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.