Skip to main content

Advertisement

Log in

Complex ligand-protein systems: a globally convergent iterative method for the n×m case

  • Published:
Journal of Mathematical Biology Aims and scope Submit manuscript

Abstract.

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: 1 November 2000 / Published online: 21 August 2001

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pradines, J., Hasty, J. & Pakdaman, K. Complex ligand-protein systems: a globally convergent iterative method for the n×m case. J Math Biol 43, 313–324 (2001). https://doi.org/10.1007/s002850100086

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002850100086

Keywords

Navigation