We present a detailed explanation of a mathematical method and numerical technique applied to solve an irregular non‐linear fitting problem that results from attempts to model the calorimetric profiles generated by the binding of phenolic ligands to the insulin hexamer. The method employed uses a non‐traditional approach to modeling data. Rather than start with a simplified model, we use a hierarchical tree of physical models with different degrees of sophistication. Starting with the model of highest dimension, we work our way to an optimum model which is of a lower dimension and is less complex. The algorithm uses two complementary techniques. First, a sensitivity analysis in the vicinity of the optimal point for each model is used to estimate errors in the parameters; that, in turn, provides the user with insight for model simplification. Second, we utilize the optimized model in the prediction of new experimental curves. The core of the method combines a strategy based on the proper split of the initial global numerical task into three locally independent subtasks, and induces a specific split in the search space. The application of three different optimization techniques (two parametric and one variational) with an alternating objective function defined in corresponding subspaces, in combination with the search along the hierarchical tree of mathematical models, enables us to overcome difficult computational problems, including over‐parametrization. We have obtained very accurate fits to a number of calorimetric curves, resulting in a quantitative description of intrinsic functional (free ligand concentration) and vector (equilibrium coefficients and enthalpies of binding) parameters. These quantitative results can now be used to improve the stability of insulin formulations. We believe that, with small modifications to the model, the method and algorithms presented in this article can be applied to other protein‐ligand systems.
Article navigation
1 June 2000
Research Article|
June 01 2000
Global stochastic optimization in hierarchical modeling of ligand/protein binding profiles
Alexander D. Varshavsky;
Alexander D. Varshavsky
Department of Statistical and Mathematical Sciences, Lilly Research Laboratories, Indianapolis, Indiana, USA
Search for other works by this author on:
Duane T. Birnbaum;
Duane T. Birnbaum
Department of Biopharmaceutical Development, Eli Lilly and Company, Lilly Research Laboratories, Indianapolis, Indiana, USA,
Search for other works by this author on:
John M. Beals;
John M. Beals
Department of Biopharmaceutical Development, Eli Lilly and Company, Lilly Research Laboratories, Indianapolis, Indiana, USA, and
Search for other works by this author on:
Bo E. Saxberg
Bo E. Saxberg
Department of Statistical and Mathematical Sciences, Lilly Research Laboratories, Indianapolis, Indiana, USA
Search for other works by this author on:
Publisher: Emerald Publishing
Online ISSN: 1758-7883
Print ISSN: 0368-492X
© MCB UP Limited
2000
Kybernetes (2000) 29 (4): 452–473.
Citation
Varshavsky AD, Birnbaum DT, Beals JM, Saxberg BE (2000), "Global stochastic optimization in hierarchical modeling of ligand/protein binding profiles". Kybernetes, Vol. 29 No. 4 pp. 452–473, doi: https://doi.org/10.1108/03684920010322217
Download citation file:
New and popular articles
Suggested Reading
Bionics: psychocybernetics of the human memory – Part I: memory processes
Kybernetes (August,1996)
Bionics: psychocybernetics of the human memory –Part II: modelling of the human instantaneous memory
Kybernetes (December,1996)
Bionics: psychocybernetics of the human memory ‐ Part IV: modelling of the human long‐term memory
Kybernetes (April,1999)
Bionics: psychocybernetics of human memory: Part III: modelling of the human short‐term memory
Kybernetes (March,1997)
A fully‐distributed parallel global search algorithm
Engineering Computations (February,2001)
Related Chapters
ANALYSIS OF A RC SIMPLY SUPPORTED DEEP BEAM WITH NONLINEAR COMPUTER PROGRAM
Application of Codes, Design and Regulations: Proceedings of the International Conference held at the University of Dundee, Scotland, UK on 5–7 July 2005
Enacting the Everyday: The Dialectic of Algorithms, Data Activism, and Platform Power
Contesting Platform Power: The Oppositional Affordances of Data Activism
Conclusion: The Future of Platform Power and Data Activism
Contesting Platform Power: The Oppositional Affordances of Data Activism
Recommended for you
These recommendations are informed by your reading behaviors and indicated interests.
