Skip Navigation


PEDS Advance Access originally published online on July 2, 2009
Protein Engineering Design and Selection 2009 22(9):561-567; doi:10.1093/protein/gzp035
This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
22/9/561    most recent
gzp035v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Kelley, L. A.
Right arrow Articles by Sternberg, M. J.E.
PubMed
Right arrow PubMed Citation
Right arrow Articles by Kelley, L. A.
Right arrow Articles by Sternberg, M. J.E.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2009. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oxfordjournals.org

This article appears in the following Protein Engineering issue: Computational Methods Special Issue [View the issue table of contents]

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

Lawrence A. Kelley1,3, Paul J. Shrimpton1, Stephen H. Muggleton2 and Michael J.E. Sternberg1

1Structural Bioinformatics Group, Division of Molecular Biosciences 2Computational Bioinformatics Laboratory, Department of Computing, Imperial College London, London, UK

3 To whom correspondence should be addressed. E-mail: l.a.kelley{at}imperial.ac.uk

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/.

Keywords: functional residues/SVILP/machine learning/protein structure/function prediction

Received June 9, 2009; revised June 9, 2009; accepted June 11, 2009.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.