CSDL Home IEEE/ACM Transactions on Computational Biology and Bioinformatics 2011 vol.8 Issue No.04 - July/August
Issue No.04 - July/August (2011 vol.8)
Bashir S. Sadjad , University of Waterloo, Waterloo
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2010.70
Predicting the binding mode(s) of a drug molecule to a target receptor is pivotal in structure-based rational drug design. In contrast to most approaches to solve this problem, the idea in this paper is to analyze the search problem from a computational perspective. By building on top of an existing docking tool, new methods are proposed and relevant computational results are proven. These methods and results are applicable for other place-and-join frameworks as well. A fast approximation scheme for the docking of rigid fragments is described that guarantees certain geometric approximation factors. It is also demonstrated that this can be translated into an energy approximation for simple scoring functions. A polynomial time algorithm is developed for the matching phase of the docked rigid fragments. It is demonstrated that the generic matching problem is NP-hard. At the same time, the optimality of the proposed algorithm is proven under certain scoring function conditions. The matching results are also applicable for some of the fragment-based de novo design methods. On the practical side, the proposed method is tested on 829 complexes from the PDB. The results show that the closest predicted pose to the native structure has the average RMS deviation of 1.06 Å.
Life and medical sciences, biology and genetics, geometrical problems and computations, curve, surface, solid, and object representations, bioinformatics (genome or protein) databases.
Bashir S. Sadjad, "Toward a Robust Search Method for the Protein-Drug Docking Problem", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.8, no. 4, pp. 1120-1133, July/August 2011, doi:10.1109/TCBB.2010.70