Discovering rules for protein-ligand specificity using support vector inductive logic programming

7Citations
Citations of this article
28Readers
Mendeley users who have this article in their library.

Abstract

Structural genomics initiatives are rapidly generating vast numbers of protein structures. Comparative modelling is also capable of producing accurate structural models for many protein sequences. However, for many of the known structures, functions are not yet determined, and in many modelling tasks, an accurate structural model does not necessarily tell us about function. Thus, there is a pressing need for high-throughput methods for determining function from structure. The spatial arrangement of key amino acids in a folded protein, on the surface or buried in clefts, is often the determinants of its biological function. A central aim of molecular biology is to understand the relationship between such substructures or surfaces and biological function, leading both to function prediction and to function design. We present a new general method for discovering the features of binding pockets that confer specificity for particular ligands. Using a recently developed machine-learning technique which couples the rule-discovery approach of inductive logic programming with the statistical learning power of support vector machines, we are able to discriminate, with high precision (90%) and recall (86%) between pockets that bind FAD and those that bind NAD on a large benchmark set given only the geometry and composition of the backbone of the binding pocket without the use of docking. In addition, we learn rules governing this specificity which can feed into protein functional design protocols. An analysis of the rules found suggests that key features of the binding pocket may be tied to conformational freedom in the ligand. The representation is sufficiently general to be applicable to any discriminatory binding problem. All programs and data sets are freely available to non-commercial users at http://www.sbg.bio.ic.ac.uk/svilp- ligand/. © The Author 2009. Published by Oxford University Press. All rights reserved.

References Powered by Scopus

Automated docking using a Lamarckian genetic algorithm and an empirical binding free energy function

10162Citations
N/AReaders
Get full text

Protein structure prediction and structural genomics

1377Citations
N/AReaders
Get full text

Dali: a network tool for protein structure comparison

1342Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Protein structural bioinformatics: An overview

25Citations
N/AReaders
Get full text

Prediction of flavin mono-nucleotide binding sites using modified PSSM profile and ensemble support vector machine

9Citations
N/AReaders
Get full text

Knowledge discovery in variant databases using inductive logic programming

6Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Kelley, L. A., Shrimpton, P. J., Muggleton, S. H., & Sternberg, M. J. E. (2009). Discovering rules for protein-ligand specificity using support vector inductive logic programming. Protein Engineering, Design and Selection, 22(9), 561–567. https://doi.org/10.1093/protein/gzp035

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 9

47%

Researcher 5

26%

Professor / Associate Prof. 4

21%

Lecturer / Post doc 1

5%

Readers' Discipline

Tooltip

Agricultural and Biological Sciences 8

44%

Computer Science 4

22%

Biochemistry, Genetics and Molecular Bi... 4

22%

Medicine and Dentistry 2

11%

Save time finding and organizing research with Mendeley

Sign up for free