Global Sensitivity Analysis of Biochemical Reaction Networks via Semidefinite Programming

Details Global Sensitivity Analysis of Biochemical Reaction Networks via Semidefinite Programming Global Sensitivity Analysis of Biochemical Reaction Networks via Semidefinite Programming

2009-04-29

arxiv.org/abs/0904.4592v1

Biology

Quantitative Biology

Molecular Networks

Proceedings of the 17th IFAC World Congress, Seoul, Korea, 2008

Scientific paper

We study the problem of computing outer bounds for the region of steady states of biochemical reaction networks modelled by ordinary differential equations, with respect to parameters that are allowed to vary within a predefined region. Using a relaxed version of the corresponding feasibility problem and its Lagrangian dual, we show how to compute certificates for regions in state space not containing any steady states. Based on these results, we develop an algorithm to compute outer bounds for the region of all feasible steady states. We apply our algorithm to the sensitivity analysis of a Goldbeter--Koshland enzymatic cycle, which is a frequent motif in reaction networks for regulation of metabolism and signal transduction.

Affiliated with

Also associated with

No associations

Rating

Global Sensitivity Analysis of Biochemical Reaction Networks via Semidefinite Programming does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Global Sensitivity Analysis of Biochemical Reaction Networks via Semidefinite Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Global Sensitivity Analysis of Biochemical Reaction Networks via Semidefinite Programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-511995