{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T19:31:59Z","timestamp":1791401519671,"version":"4.3.3"},"reference-count":21,"publisher":"Oxford University Press (OUP)","issue":"16","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,8,15]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Motivation: Current computational methods for the prediction of function from structure are restricted to the detection of similarities and subsequent transfer of functional annotation. In a significant minority of cases, global sequence or structural (fold) similarities do not provide clues about protein function. In these cases, one alternative is to detect local binding site similarities. These may still reflect more distant evolutionary relationships as well as unique physico-chemical constraints necessary for binding similar ligands, thus helping pinpoint the function. In the present work, we ask the following question: is it possible to discriminate within a dataset of non-homologous proteins those that bind similar ligands based on their binding site similarities?<\/jats:p>\n               <jats:p>Methods: We implement a graph-matching-based method for the detection of 3D atomic similarities introducing some simplifications that allow us to extend its applicability to the analysis of large allatom binding site models. This method, called IsoCleft, does not require atoms to be connected either in sequence or space. We apply the method to a cognate-ligand bound dataset of non-homologous proteins. We define a family of binding site models with decreasing knowledge about the identity of the ligand-interacting atoms to uncouple the questions of predicting the location of the binding site and detecting binding site similarities. Furthermore, we calculate the individual contributions of binding site size, chemical composition and geometry to prediction performance.<\/jats:p>\n               <jats:p>Results: We find that it is possible to discriminate between different ligand-binding sites. In other words, there is a certain uniqueness in the set of atoms that are in contact to specific ligand scaffolds. This uniqueness is restricted to the atoms in close proximity of the ligand in which case, size and chemical composition alone are sufficient to discriminate binding sites. Discrimination ability decreases with decreasing knowledge about the identity of the ligand-interacting binding site atoms. The decrease is quite abrupt when considering size and chemical composition alone, but much slower when including geometry. We also observe that certain ligands are easier to discriminate. Interestingly, the subset of binding site atoms belonging to highly conserved residues is not sufficient to discriminate binding sites, implying that convergently evolved binding sites arrived at dissimilar solutions.<\/jats:p>\n               <jats:p>Availability: IsoCleft can be obtained from the authors.<\/jats:p>\n               <jats:p>Contact: \u00a0rafael.najmanovich@ebi.ac.uk<\/jats:p>","DOI":"10.1093\/bioinformatics\/btn263","type":"journal-article","created":{"date-parts":[[2008,8,9]],"date-time":"2008-08-09T13:08:02Z","timestamp":1218287282000},"page":"i105-i111","source":"Crossref","is-referenced-by-count":85,"title":["Detection of 3D atomic similarities and their use in the discrimination of small molecule protein-binding sites"],"prefix":"10.1093","volume":"24","author":[{"given":"Rafael","family":"Najmanovich","sequence":"first","affiliation":[{"name":"1 European Bioinformatics Institute, Wellcome Trust Genome Campus, Cambridge, CB10 1SD, UK and 2Institute of Mathematics and Computer Science, University of Latvia, Raina bulvaris 29, Riga, LV-1459, Latvia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Natalja","family":"Kurbatova","sequence":"additional","affiliation":[{"name":"1 European Bioinformatics Institute, Wellcome Trust Genome Campus, Cambridge, CB10 1SD, UK and 2Institute of Mathematics and Computer Science, University of Latvia, Raina bulvaris 29, Riga, LV-1459, Latvia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Janet","family":"Thornton","sequence":"additional","affiliation":[{"name":"1 European Bioinformatics Institute, Wellcome Trust Genome Campus, Cambridge, CB10 1SD, UK and 2Institute of Mathematics and Computer Science, University of Latvia, Raina bulvaris 29, Riga, LV-1459, Latvia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2008,8,9]]},"reference":[{"key":"2023020210500226500_B1","doi-asserted-by":"crossref","first-page":"e97","DOI":"10.1371\/journal.pbio.0050097","article-title":"Structural and chemical profiling of the human cytosolic sulfotransferases","volume":"5","author":"Allali-Hassani","year":"2007","journal-title":"PLoS Biol"},{"key":"2023020210500226500_B2","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1006\/jmbi.2000.4474","article-title":"ConSurf: an algorithmic tool for the identification of functional regions in proteins by surface mapping of phylogenetic information","volume":"307","author":"Armon","year":"2001","journal-title":"J. Mol. Biol"},{"key":"2023020210500226500_B3","first-page":"699","article-title":"Least-Squares Fitting Of 2 3-D Point Sets","volume":"9","author":"Arun","year":"1987","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell"},{"key":"2023020210500226500_B4","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1002\/prot.20123","article-title":"Towards a structural classification of phosphate binding sites in protein-nucleotide complexes: an automated all-against-all structural comparison using geometric matching","volume":"56","author":"Brakoulias","year":"2004","journal-title":"Proteins"},{"key":"2023020210500226500_B5","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1145\/362342.362367","article-title":"Algorithm 457: finding all cliques of an undirected graph","volume":"16","author":"Bron","year":"1973","journal-title":"Communications of the ACM"},{"key":"2023020210500226500_B6","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1002\/prot.20769","article-title":"A method for localizing ligand binding pockets in protein structures","volume":"62","author":"Glaser","year":"2006","journal-title":"Proteins"},{"key":"2023020210500226500_B7","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1002\/prot.20305","article-title":"The ConSurf-HSSP database: the mapping of evolutionary conservation among homologs onto PDB structures","volume":"58","author":"Glaser","year":"2005","journal-title":"Proteins"},{"key":"2023020210500226500_B8","first-page":"275","article-title":"The rapid generation of mutation data matrices from protein sequences","volume":"8","author":"Jones","year":"1992","journal-title":"Comput. Appl. Biosci"},{"key":"2023020210500226500_B9","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/j.jmb.2007.01.086","article-title":"Shape variation in protein binding pockets and their ligands","volume":"368","author":"Kahraman","year":"2007","journal-title":"J. Mol. Biol"},{"key":"2023020210500226500_B10","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s002490050065","article-title":"A method to search for similar protein local structures at ligand binding sites and its application to adenine recognition","volume":"26","author":"Kobayashi","year":"1997","journal-title":"Eur. Biophys. J"},{"key":"2023020210500226500_B11","volume-title":"Combinatorial Algorithms: Generation, Enumeration and Search.","author":"Kresher","year":"1998"},{"key":"2023020210500226500_B12","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0263-7855(95)00073-9","article-title":"Surfnet \u2013 a program for visualizing molecular-surfaces, cavities, and intermolecular interactions","volume":"13","author":"Laskowski","year":"1995","journal-title":"J. Mol. Graph"},{"key":"2023020210500226500_B13","first-page":"2438","article-title":"Protein clefts in molecular recognition and function","volume":"5","author":"Laskowski","year":"1996","journal-title":"Protein Sci"},{"key":"2023020210500226500_B14","doi-asserted-by":"crossref","first-page":"847","DOI":"10.2144\/05386TE01","article-title":"Prediction of protein function from structure: insights from methods for the detection of local structural similarities","volume":"38","author":"Najmanovich","year":"2005","journal-title":"Biotechniques"},{"key":"2023020210500226500_B15","doi-asserted-by":"crossref","first-page":"e104","DOI":"10.1093\/bioinformatics\/btl292","article-title":"Analysis of binding site similarity, small-molecule similarity and experimental binding profiles in the human cytosolic sulfotransferase family","volume":"23","author":"Najmanovich","year":"2007","journal-title":"Bioinformatics"},{"key":"2023020210500226500_B16","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1109\/MCSE.1997.641603","article-title":"Geometric hashing","volume":"4","author":"Rigoutsos","year":"1997","journal-title":"IEEE Comput. Sci. Eng"},{"key":"2023020210500226500_B17","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/S0022-2836(02)00811-2","article-title":"A new method to detect related function among proteins independent of sequence and fold homology","volume":"323","author":"Schmitt","year":"2002","journal-title":"J. Mol. Biol"},{"key":"2023020210500226500_B18","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1002\/(SICI)1097-0134(199605)25:1<120::AID-PROT10>3.0.CO;2-M","article-title":"Molecular docking using surface complementarity","volume":"25","author":"Sobolev","year":"1996","journal-title":"Proteins Struct. Funct. Genet"},{"key":"2023020210500226500_B19","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1016\/j.jmb.2004.04.012","article-title":"Recognition of functional sites in protein structures","volume":"339","author":"Shulman-Peleg","year":"2004","journal-title":"J. Mol. Biol"},{"key":"2023020210500226500_B20","doi-asserted-by":"crossref","first-page":"W337","DOI":"10.1093\/nar\/gki482","article-title":"SiteEngines: recognition and comparison of binding sites and protein-protein interfaces","volume":"33","author":"Shulman-Peleg","year":"2005","journal-title":"Nucleic Acids Res"},{"key":"2023020210500226500_B21","doi-asserted-by":"crossref","first-page":"1522","DOI":"10.1093\/bioinformatics\/bth113","article-title":"Efficient similarity search in protein structure databases by k-clique hashing","volume":"20","author":"Weskamp","year":"2004","journal-title":"Bioinformatics"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/24\/16\/i105\/49050544\/bioinformatics_24_16_i105.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/24\/16\/i105\/49050544\/bioinformatics_24_16_i105.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,2]],"date-time":"2023-02-02T12:42:10Z","timestamp":1675341730000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/24\/16\/i105\/199212"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8,9]]},"references-count":21,"journal-issue":{"issue":"16","published-print":{"date-parts":[[2008,8,15]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btn263","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2008,8,15]]},"published":{"date-parts":[[2008,8,9]]}}}