Approaching the CAPRI challenge with an efficient geometry‐based docking

Citations Over TimeTop 22% of 2005 papers

Abstract

The last 3 rounds (3-5) of CAPRI included a wide range of docking targets. Several targets were especially challenging, since they involved large-scale movements and symmetric rearrangement, while others were based on homology models. We have approached the targets with a variety of geometry-based docking algorithms that include rigid docking, symmetric docking, and flexible docking with symmetry constraints. For all but 1 docking target, we were able to submit at least 1 acceptable quality prediction. Here, we detail for each target the prediction methods used and the specific biological data employed, and supply a retrospective analysis of the results. We highlight the advantages of our techniques, which efficiently exploit the geometric shape complementarity properties of the interaction. These enable them to run only few minutes on a standard PC even for flexible docking, thus proving their scalability toward computational genomic scale experiments. We also outline the major required enhancements, such as the introduction of side-chain position refinement and the introduction of flexibility for both docking partners.

Related Papers

• → LZerD Protein-Protein Docking Webserver Enhanced With de novo Structure Prediction(2021)50 cited
• → Protein docking prediction using predicted protein-protein interface(2012)77 cited
• → Application of docking methodologies to modeled proteins(2020)45 cited
• → Structural quality of unrefined models in protein docking(2016)4 cited
• → Modelling Protein–Protein and Protein–DNA Docking(2001)15 cited