Jump to main content
Jump to site search
Access to RSC content Close the message box

Continue to access RSC content when you are not at your institution. Follow our step-by-step guide.


Issue 22, 2004
Previous Article Next Article

Predicting protein–ligand binding affinities: a low scoring game?

Author affiliations

Abstract

We have investigated the performance of five well known scoring functions in predicting the binding affinities of a diverse set of 205 protein–ligand complexes with known experimental binding constants, and also on subsets of mutually similar complexes. We have found that the overall performance of the scoring functions on the diverse set is disappointing, with none of the functions achieving r2 values above 0.32 on the whole dataset. Performance on the subsets was mixed, with four of the five functions predicting fairly well the binding affinities of 35 proteinases, but none of the functions producing any useful correlation on a set of 38 aspartic proteinases. We consider two algorithms for producing consensus scoring functions, one based on a linear combination of scores from the five individual functions and the other on averaging the rankings produced by the five functions. We find that both algorithms produce consensus functions that generally perform slightly better than the best individual scoring function on a given dataset.

Graphical abstract: Predicting protein–ligand binding affinities: a low scoring game?

Back to tab navigation

Article information


Submitted
24 Jun 2004
Accepted
03 Sep 2004
First published
27 Sep 2004

Org. Biomol. Chem., 2004,2, 3267-3273
Article type
Paper

Predicting proteinligand binding affinities: a low scoring game?

P. M. Marsden, D. Puvanendrampillai, J. B. O. Mitchell and R. C. Glen, Org. Biomol. Chem., 2004, 2, 3267
DOI: 10.1039/B409570G

Social activity

Search articles by author

Spotlight

Advertisements