Abstract
Molecular mechanisms of drug action are often based on an interaction of them with target macromolecules, such as proteins and nucleonic acids. The formation of ligandtarget complexes is typical for biologically active compounds, including activators and inhibitors of various enzymes. Prediction of the dissociation constant (Kd) of protein-ligand complex is often used as a scoring function for the modeled complexes and there are many approaches in the field of prediction of such constant [1]. In the present work various parameters of protein-ligand complexes were used to predict Kd. These parameters can be quickly calculated immediately during docking procedure, which we usually used for complexes modeling. The artificial feedforward neural networks (AFNNs) were used as a mathematical approach to prediction of protein-ligand complexes Kd. In practice, neural networks are especially useful for classification and function approximation problems, which have a lot of training data. Neural networks are often used in situations where you do not have enough prior knowledge to set the activation function, as in case of the prediction of the proteinligand complexes dissociation constant.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krepets, V.V., Belkina, N.V. (2000). Prediction of Binding Affinities for Protein-Ligand Complexes with Neural Network Models. In: Arikawa, S., Morishita, S. (eds) Discovery Science. DS 2000. Lecture Notes in Computer Science(), vol 1967. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44418-1_19
Download citation
DOI: https://doi.org/10.1007/3-540-44418-1_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41352-3
Online ISBN: 978-3-540-44418-3
eBook Packages: Springer Book Archive