Depth: a web server to compute depth, cavity sizes, detect potential small-molecule ligand-binding cavities and predict the pKa of ionizable residues in proteins

Tan, Kuan Pern ; Nguyen, Thanh Binh ; Patel, Siddharth ; Varadarajan, Raghavan ; Madhusudhan, M. S. (2013) Depth: a web server to compute depth, cavity sizes, detect potential small-molecule ligand-binding cavities and predict the pKa of ionizable residues in proteins Nucleic Acids Research, 41 (W1). W314-W321. ISSN 0305-1048

[img]
Preview
PDF - Other
521kB

Official URL: https://academic.oup.com/nar/article-lookup/doi/10...

Related URL: http://dx.doi.org/10.1093/nar/gkt503

Abstract

Residue depth accurately measures burial and parameterizes local protein environment. Depth is the distance of any atom/residue to the closest bulk water. We consider the non-bulk waters to occupy cavities, whose volumes are determined using a Voronoi procedure. Our estimation of cavity sizes is statistically superior to estimates made by CASTp and VOIDOO, and on par with McVol over a data set of 40 cavities. Our calculated cavity volumes correlated best with the experimentally determined destabilization of 34 mutants from five proteins. Some of the cavities identified are capable of binding small molecule ligands. In this study, we have enhanced our depth-based predictions of binding sites by including evolutionary information. We have demonstrated that on a database (LigASite) of ∼200 proteins, we perform on par with ConCavity and better than MetaPocket 2.0. Our predictions, while less sensitive, are more specific and precise. Finally, we use depth (and other features) to predict pKas of GLU, ASP, LYS and HIS residues. Our results produce an average error of just <1 pH unit over 60 predictions. Our simple empirical method is statistically on par with two and superior to three other methods while inferior to only one. The DEPTH server (http://mspc.bii.a-star.edu.sg/depth/) is an ideal tool for rapid yet accurate structural analyses of protein structures.

Item Type:Article
Source:Copyright of this article belongs to Oxford University Press.
ID Code:111412
Deposited On:27 Nov 2017 12:28
Last Modified:27 Nov 2017 12:28

Repository Staff Only: item control page