Abstract
The ability to reliably predict protein-protein and protein-ligand interactions is important for identifying druggable binding sites and for understanding how proteins communicate. Most currently available algorithms identify cavities on the protein surface as potential ligand recognition sites. The method described here does not explicitly look for cavities but uses small surface patches consisting of triplets of adjacent surface atomic groups that can be touched simultaneously by a probe sphere representing a solvent molecule. A total of 455 different types of triplets can be identified. A training set of 309 protein-ligand protein X-ray structures has been used to generate interface propensities for the triplets, which can be used to predict their involvement in ligand-binding interactions. The success rate for locating protein-ligand binding sites on protein surfaces using this new surface triplet propensities (STP) algorithm is 88% which compares well with currently available grid-based and energy-based approaches. Q-SiteFinder's dataset (Laurie and Jackson, 2005. Bioinformatics, 21, 1908-1916) was used to show the favorable performance of STP. An analysis of the different triplet types showed that higher ligand binding propensity is related to more polarizable surfaces. The interaction statistics between triplet atoms on the protein surface and ligand atoms have been used to estimate statistical free energies of interaction. The ΔG(stat) for halogen atoms interacting with hydrophobic triplets is -0.6 kcal/mol and an estimate of the maximal ΔG(stat) for a ligand atom interacting with a triplet in a binding pocket is -1.45 kcal/mol. Freely available online at http://opus.bch.ed.ac.uk/stp. Website implemented in Php, with all major browsers supported. m.walkinshaw@ed.ac.uk Supplementary data are available at Bioinformatics online.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.