Abstract
Identifying the location of binding sites on proteins is of fundamental importance for a wide range of applications including molecular docking, de novo drug design, structure identification and comparison of functional sites. Structural genomic projects are beginning to produce protein structures with unknown functions. Therefore, efficient methods are required if all these structures are to be properly annotated. When comparing a complete protein with all complete protein structures in the PDB database, experiments show that all the existing approaches have recall values less than 50%. This implies that more than 50% of real binding sites cannot be reported by those existing approaches. We develop an efficient approach for finding binding sites between two proteins. Our approach consists of three steps, local sequence alignment, protein surface detection, and 3D structures comparison. Experiments show that the average recall value of our approach is 82% and the precision of our approach is also significantly better than the existing approaches. The software package is available at http://sites.google.com/site/guofeics/bsfinder .
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Laurie, A.T., Jackson, R.M.: Q-SiteFinder: an energy-based method for the prediction of protein-ligand binding sites. Bioinformatics 21, 1908–1916 (2005)
Bradford, J.R., Westhead, D.R.: Improved prediction of protein-protein binding sites using a support vector machines approach. Bioinformatics 21, 1487–1494 (2004)
Chen, Y.-C., Lo, Y.-S., Hsu, W.-C., Yang, J.-M.: 3D-partner: a web server to infer interacting partners and binding models. Nucleic Acids Research 35, W561–W567 (2007)
Lo, A., Chiu, Y.-Y., Rodland, E.A., Lyu, P.-C., Sung, T.-Y., Hsu, W.-L.: Predicting helix-helix interactions from residue contacts in membrane proteins. Bioinformatics 25, 996–1003 (2008)
Siew, N., Elofsson, A., Rychlewski, L., Fischer, D.: Maxsub: an automated measure for the assessment of protein structure prediction quality. Bioinformatics 16(9), 776–785 (2000)
Zemla, A.: LGA: a method for fnding 3D similarities in protein structures. Nucl. Acids Res. 31(13), 3370–3374 (2003)
Zhang, Y., Skolnick, J.: Scoring function for automated assessment of protein structure template quality. Proteins: Structure, Function, and Bioinformatics 57(4), 702–710 (2004)
Li, H., Li, J., Wong, L.: Discovering motif pairs at interaction sites from protein sequences on a proteome-wide scale. Bioinformatics 22(8), 989–996 (2006)
Li, S.C., Bu, D., Xu, J., Li, M.: Finding largest well-predicted subset of protein structure models. In: Ferragina, P., Landau, G.M. (eds.) CPM 2008. LNCS, vol. 5029, pp. 44–55. Springer, Heidelberg (2008)
Pennec, X., Ayache, N.: A geometric algorithm to find small but highly similar 3D substructures in proteins. Bioinformatics 14, 516–522 (1998)
Fischer, D., Bachar, O., Nussinov, R., Wolfson, H.: An efficient automated computer vision based technique for detection of three dimensional structural motifs in proteins. J. Biomol. Struct. Dynam. 9, 769–789 (1992)
Bachar, O., Fischer, D., Nussinov, R., Wolfson, H.: A computer vision based technique for sequence independent structural comparison of proteins. Protein Eng. 6, 279–288 (1993)
Liu, X., Li, J., Wang, L.: Modeling protein interacting groups by quasi-bicliques: complexity, algorithm and application. IEEE/ACM Transactions on Computational Biology and Bioinformatics 7(2), 354–364 (2010)
Jambon, M., Imberty, A., Deleage, G., Geourion, C.: A new bioinformatic approach to detect common 3D sites in protein structures. Proteins 52, 137–145 (2003)
Murzin, G., Brenner, E., Hubbard, T., Chothia, C.: SCOP: a structural classification of proteins database for the investigation of sequences and structures. J. Mol. Biol. 247, 536–540 (1995)
Jambon, M.: The SuMo server: 3D search for protein functional sites. Bioinformatics 21, 3929–3930 (2005)
Gold, N.D., Jackson, R.M.: SitesBase: a database for structure-based protein-ligand binding site comparisons. Nucleic Acids Res. 34(suppl. 1), D231–D234 (2006)
Ausiello, G.: pdbFun: mass selection and fast comparison of annotated PDB residues. Nucleic Acids Res. 137, W133–W137 (2005)
Shulman-Peleg, A.: Recognition of functional sites in protein structures. J. Mol. Biol. 339, 607–633 (2004)
Täubig, H., Buchner, A., Griebsch, J.: PAST: fast structure-based searching in the PDB. Nucleic Acids Res. 34, W20–W23 (2006)
Smith, T.F., Waterman, M.S.: Identification of Common Molecular Subsequences. Journal of Molecular Biology 147, 195–197 (1981)
Guo, F., Wang, L., Yang, Y., Lin, G.: Efficient Algorithms for 3D Protein Substructure Identification. In: The International Conference on Bioinformatics and Biomedical Engineering (2010)
Huang, B., Schröder, M.: LIGSITEcsc: predicting ligand binding sites using the Connolly surface and degree of conservation. BMC Struct. Biol. 6, 19–29 (2006)
Henrich, S.: Computational approaches to identifying and characterizing protein binding sites for ligand design. Journal of Molecular Recognition 23(2), 209–219 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guo, F., Wang, L. (2011). Computing the Protein Binding Sites. In: Chen, J., Wang, J., Zelikovsky, A. (eds) Bioinformatics Research and Applications. ISBRA 2011. Lecture Notes in Computer Science(), vol 6674. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21260-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-21260-4_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21259-8
Online ISBN: 978-3-642-21260-4
eBook Packages: Computer ScienceComputer Science (R0)