Inherent limitations in protein-protein docking procedures

26Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Motivation: The limited success rate of protein-protein docking procedures is generally attributed to structure differences between the bound and unbound states of the molecules. Herein we analyze a large dataset of protein-protein docking results and identify additional parameters that affect the performance of docking procedures. Results: We find that the distinction between nearly correct models (NCMs) and decoys depends on the size of the interface to be predicted thus setting a limit to the prediction ability of docking procedures, particularly those in which the geometric complementarity descriptor is dominant. The geometric complementarity score in grid-based docking carries a large statistical error which further reduces the distinction between NCMs and decoys. We propose a method for correcting the statistical error and show that the distinction is improved when the docking models are ranked by statistically equivalent scores. © 2007 Oxford University Press.

Cite

CITATION STYLE

APA

Kowalsman, N., & Eisenstein, M. (2007). Inherent limitations in protein-protein docking procedures. Bioinformatics, 23(4), 421–426. https://doi.org/10.1093/bioinformatics/btl524

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free