z-logo
Premium
Voronoi binding site models: Calculation of binding modes and influence of drug binding data accuracy
Author(s) -
Boulu Laurent G.,
Crippen Gordon M.
Publication year - 1989
Publication title -
journal of computational chemistry
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.907
H-Index - 188
eISSN - 1096-987X
pISSN - 0192-8651
DOI - 10.1002/jcc.540100509
Subject(s) - voronoi diagram , binding site , quadratic equation , minification , binding energy , energy minimization , simple (philosophy) , chemistry , mathematics , geometry , computational chemistry , physics , mathematical optimization , atomic physics , biochemistry , philosophy , epistemology
A new and accurate method for calculating the geometrically allowed modes of binding of a ligand molecule to a Voronoi site model is reported. It is shown that the feasibility of the binding of a group of atoms to a Voronoi site reduces to a simple set of linear and quadratic inequalities and quadratic equalities which can be solved by minimization of a simple function. Newton's numerical method of solution coupled to a line search proved to be successful. Moreover, we have developed efficient molecular and site data bases to discard quickly infeasible binding modes without time‐consuming numerical calculation. The method is tested with a data set consisting of the binding constants for a series of biphenyls binding to prealbumin. After determination of the conformation space of the molecules and proposal of a Voronoi site geometry, the geometrically feasible modes are calculated and the energy interaction parameters determined to fit the observed binding energies to the site within experimental error ranges. We actually allowed these ranges to vary in order to study the influence of their broadness on the site geometry and found that as they increase, one can first model the receptor as a three‐region site then as a single region site, but never as a two‐region site.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here