Identification of near-native structures by clustering protein docking conformations.
Most state-of-the-art protein-protein docking algorithms use the Fast Fourier Transform (FFT) technique to sample the six-dimensional translational and rotational space. Scoring functions including shape complementarity, electrostatics, and desolvation are usually exploited in ranking the docking conformations. While these rigid-body docking methods provide good performance in bound docking, using unbound structures as input frequently leads to a high number of false positive hits. For the purpose of better selecting correct docking conformations, we structurally cluster the docking decoys generated by four widely-used FFT-based protein-protein docking methods. In all cases, the selection based on cluster size outperforms the ranking based on the inherent scoring function. If we cluster decoys from different servers together, only marginal improvement is obtained in comparison with clustering decoys from the best individual server. A collection of multiple decoy sets of comparable quality will be the key to improve the clustering result from meta-docking servers.
Lorenzen
Stephan
S
Center of Bioinformatics, Department of Molecular Biosciences, University of Kansas, Lawrence, Kansas 66046, USA.
Zhang
Yang
Y
D000465:Algorithms; D019295:Computational Biology / Q000379:methods*; D005583:Fourier Analysis; D046912:Multiprotein Complexes / Q000737:chemistry*; D011485:Protein Binding; D011487:Protein Conformation; D011506:Proteins / Q000737:chemistry*
D046912:Multiprotein Complexes; D011506:Proteins