Complex ligand-protein systems: a globally convergent iterative method for the n x m case.
When n types of univalent ligands are competing for the binding to m types of protein sites, the determination of the system composition at equilibrium reduces to the solving of a non-linear system of n equations in C = [0; 1](n). We present an iterative method to solve such a system. We show that the sequence presented here is always convergent, regardless of the initial value in C. We also prove that the limit of this sequence is the unique solution in C of the non-linear system of equations.
Pradines
J R
JR
Center for BioDynamics, Biomedical Engineering Department, Boston University, MA 02215, USA. pradines@bu.edu
Hasty
J
J
Pakdaman
K
K
D000465:Algorithms; D001665:Binding Sites; D001667:Binding, Competitive; D001798:Blood Proteins / Q000378:metabolism; D006728:Hormones / Q000378:metabolism; D006801:Humans; D007700:Kinetics; D008024:Ligands; D008954:Models, Biological; D011485:Protein Binding; D011506:Proteins / Q000378:metabolism*
D001798:Blood Proteins; D006728:Hormones; D008024:Ligands; D011506:Proteins