Where are the boundaries? Automated pocket detection for druggability studies

Computer-based prediction of protein druggability is an essential task in the drug development process. Early identification of disease modifying targets that can be modulated by low-molecular weight compounds can help to speed up and reduce costs in drug discovery. Recently, first methods have been presented performing a druggability estimation solely based on the 3D structure of the protein [1-3]. The essential first step for such methods is the identification of the active site. A multitude of methods exist for automated active site prediction [4-6]. However, most methods developed for automated docking procedures do not explicitly focus on the definition of the boundary of the active site. Since druggability estimates are based on structural descriptors of the active site, a precise description of the active site boundaries is vital for correct predictions. In this work, we present a method to predict protein binding pockets and split them into subpockets such that small molecules are mostly contained within one sub-pocket. The method is based on a novel strategy to geometrically detect narrow regions in pockets. For druggability predictions, such pocket descriptions result in more meaningful structural descriptors like active site surface or volume. Moreover, if several structures from oneproteinareknown,sub-pocketscangivehints about protein flexibility and induced fit conformational changes. Our method was evaluated on 718 proteins from the PDBbind [7] data set, as well as 5419 proteins from the scPDB [8] data set. Binding pockets are correctly predicted in 94 % and 93 % of the datasets. 38%, respectively 45 % of the proteins from the two datasets contain pockets which can be divided into more than one sub-pocket. In all cases one sub-pocket completely covers the co-crystallized ligand. Besides the classical

Abstract licence: CC BY-NC-ND

1. 3.

   PocketPicker: analysis of ligand binding-sites with shape descriptors · 2007

7 more references, whose wording the paper’s licence keeps private.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.