On the pseudo-steady-state approximation and Tikhonov theorem for general enzyme systems (Q1068751)

From MaRDI portal





scientific article; zbMATH DE number 3930783
Language Label Description Also known as
default for all languages
No label defined
    English
    On the pseudo-steady-state approximation and Tikhonov theorem for general enzyme systems
    scientific article; zbMATH DE number 3930783

      Statements

      On the pseudo-steady-state approximation and Tikhonov theorem for general enzyme systems (English)
      0 references
      0 references
      0 references
      1985
      0 references
      The dynamical behaviour of enzymatic networks is given by a set of nonlinear autonomous differential equations. They are usually solved by a pseudo-steady-state approximation (PSSA), corresponding to the adiabatic approximation in physics, such that the slowest reaction determines the overall velocity. The authors consider the mathematical background and establish sufficient conditions applying Tikhonov's theorem to this situation, and propose some statements about uniqueness and stability. The PSSA does not hold in open systems or in closed systems such that the crucial small parameter \(\epsilon =E_ 0/S_ 0\) (total amount of enzym by total amount of ligands) approaches zero by \(1/S_ 0\to O\) instead of \(E_ 0\to O\).
      0 references
      0 references
      general closed enzyme systems
      0 references
      ligand stoichiometry
      0 references
      open enzyme systems
      0 references
      steady state solutions
      0 references
      enzymatic networks
      0 references
      nonlinear autonomous differential equations
      0 references
      pseudo-steady-state approximation
      0 references
      adiabatic approximation
      0 references
      Tikhonov's theorem
      0 references
      uniqueness
      0 references
      stability
      0 references
      PSSA
      0 references

      Identifiers