This Article Full Text Full Text (PDF) All Versions of this Article: biophysj.104.058768v1 89/2/867    most recent Alert me when this article is cited Alert me if a correction is posted Services Similar articles in this journal Similar articles in PubMed Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via HighWire Citing Articles via Google Scholar Google Scholar Articles by Kozakov, D. Articles by Camacho, C. J. Search for Related Content PubMed PubMed Citation Articles by Kozakov, D. Articles by Camacho, C. J.

Optimal Clustering for Detecting Near-Native Conformations in Protein Docking

Dima Kozakov ^*, Karl H. Clodfelter , Sandor Vajda ^*  and Carlos J. Camacho ^*  

^* Department of Biomedical Engineering and Bioinformatics Graduate Program, Boston University, Boston, Massachusetts; and Department of Computational Biology, University of Pittsburgh, Pittsburgh, Pennsylvania

Correspondence: Address reprint requests to C. J. Camacho, E-mail: ccamacho{at}pitt.edu.

Clustering is one of the most powerful tools in computational biology. The conventional wisdom is that events that occur in clusters are probably not random. In protein docking, the underlying principle is that clustering occurs because long-range electrostatic and/or desolvation forces steer the proteins to a low free-energy attractor at the binding region. Something similar occurs in the docking of small molecules, although in this case shorter-range van der Waals forces play a more critical role. Based on the above, we have developed two different clustering strategies to predict docked conformations based on the clustering properties of a uniform sampling of low free-energy protein-protein and protein-small molecule complexes. We report on significant improvements in the automated prediction and discrimination of docked conformations by using the cluster size and consensus as a ranking criterion. We show that the success of clustering depends on identifying the appropriate clustering radius of the system. The clustering radius for protein-protein complexes is consistent with the range of the electrostatics and desolvation free energies (i.e., between 4 and 9 Å); for protein-small molecule docking, the radius is set by van der Waals interactions (i.e., at 2 Å). Without any a priori information, a simple analysis of the histogram of distance separations between the set of docked conformations can evaluate the clustering properties of the data set. Clustering is observed when the histogram is bimodal. Data clustering is optimal if one chooses the clustering radius to be the minimum after the first peak of the bimodal distribution. We show that using this optimal radius further improves the discrimination of near-native complex structures.

This article has been cited by other articles:

				V. I. Lesk and M. J. E. Sternberg 3D-Garden: a system for modelling protein-protein complexes based on conformational refinement of ensembles generated with the marching cubes algorithm Bioinformatics, May 1, 2008; 24(9): 1137 - 1144. [Abstract] [Full Text] [PDF]