Stability analysis of uncertain genetic sum regulatory networks

  • Authors:
  • G. Chesi;Y. S. Hung

  • Affiliations:
  • Department of Electrical and Electronic Engineering, University of Hong Kong, Hong Kong;Department of Electrical and Electronic Engineering, University of Hong Kong, Hong Kong

  • Venue:
  • Automatica (Journal of IFAC)
  • Year:
  • 2008

Quantified Score

Hi-index 22.15

Visualization

Abstract

This paper addresses the problem of establishing robust stability of uncertain genetic networks with sum regulatory functions. Specifically, we first consider uncertain genetic networks where the regulation occurs at the transcriptional level, and we derive a sufficient condition for robust stability by introducing a bounding set of the uncertain nonlinearity. We hence show that this condition can be formulated as a convex optimization through polynomial Lyapunov functions and polynomial descriptions of the bounding set by exploiting the square matricial representation (SMR) of polynomials which allows to establish whether a polynomial is a sum of squares (SOS) via a linear matrix inequality (LMI). Then, we propose a method for computing a family of bounding sets by means of convex optimizations. It is worthwhile to remark that these results are derived in spite of the fact that the variable equilibrium point cannot be computed as being the solution of a system of parameter-dependent nonlinear equations, and is hence unknown. Lastly, the proposed approach is extended to models where the regulation occurs at different levels and both mRNA and protein dynamics are nonlinear.