4.7 Article

Protein docking refinement by convex underestimation in the low-dimensional subspace of encounter complexes

Journal

SCIENTIFIC REPORTS
Volume 8, Issue -, Pages -

Publisher

NATURE PUBLISHING GROUP
DOI: 10.1038/s41598-018-23982-3

Keywords

-

Funding

  1. NIH/NIGMS [GM093147, GM061867]
  2. NSF [CNS-1645681, CCF-1527292, IIS-1237022]
  3. ARO [W911NF-12-1-0390]
  4. Div Of Information & Intelligent Systems
  5. Direct For Computer & Info Scie & Enginr [1237022] Funding Source: National Science Foundation

Ask authors/readers for more resources

We propose a novel stochastic global optimization algorithm with applications to the refinement stage of protein docking prediction methods. Our approach can process conformations sampled from multiple clusters, each roughly corresponding to a different binding energy funnel. These clusters are obtained using a density-based clustering method. In each cluster, we identify a smooth permissive subspace which avoids high-energy barriers and then underestimate the binding energy function using general convex polynomials in this subspace. We use the underestimator to bias sampling towards its global minimum. Sampling and subspace underestimation are repeated several times and the conformations sampled at the last iteration form a refined ensemble. We report computational results on a comprehensive benchmark of 224 protein complexes, establishing that our refined ensemble significantly improves the quality of the conformations of the original set given to the algorithm. We also devise a method to enhance the ensemble from which near-native models are selected.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available