Journal
BIOINFORMATICS
Volume 37, Issue 10, Pages 1376-1382Publisher
OXFORD UNIV PRESS
DOI: 10.1093/bioinformatics/btaa982
Keywords
-
Categories
Funding
- Direccion General de Computo y de Tecnologias de Informacion y Comunicacion (DGTIC), UNAM [LANCAD-UNAM-DGTIC-335]
Ask authors/readers for more resources
Machine-learning scoring functions have been shown to outperform standard scoring functions for predicting binding affinity of protein-ligand complexes. In this study, Extended Connectivity Interaction Features (ECIF) were introduced to describe protein-ligand complexes and create machine-learning scoring functions with improved predictions. Models built on ECIF achieved high Pearson correlation coefficients, demonstrating the descriptive power of ECIF.
Motivation: Machine-learning scoring functions (SFs) have been found to outperform standard SFs for binding affinity prediction of protein-ligand complexes. A plethora of reports focus on the implementation of increasingly complex algorithms, while the chemical description of the system has not been fully exploited. Results: Herein, we introduce Extended Connectivity Interaction Features (ECIF) to describe protein-ligand complexes and build machine-learning SFs with improved predictions of binding affinity. ECIF are a set of protein-ligand atom-type pair counts that take into account each atom's connectivity to describe it and thus define the pair types. ECIF were used to build different machine-learning models to predict protein-ligand affinities (pK(d)/pK(i)). The models were evaluated in terms of 'scoring power' on the Comparative Assessment of Scoring Functions 2016. The best models built on ECIF achieved Pearson correlation coefficients of 0.857 when used on its own, and 0.866 when used in combination with ligand descriptors, demonstrating ECIF descriptive power.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available