Abstract

Complex molecular biological processes such as transcription and translation, signal transduction, post-translational modification cascades, and metabolic pathways can be described in principle by biochemical reactions that explicitly take into account the sophisticated network of chemical interactions regulating cell life. The ability to deduce the possible qualitative behaviors of such networks from a set of reactions is a central objective and an ongoing challenge in the field of systems biology. Unfortunately, the construction of complete mathematical models is often hindered by a pervasive problem: despite the wealth of qualitative graphical knowledge about network interactions, the form of the governing nonlinearities and/or the values of kinetic constants are hard to uncover experimentally. The kinetics can also change with environmental variations. This work addresses the following question: given a set of reactions and without assuming a particular form for the kinetics, what can we say about the asymptotic behavior of the network? Specifically, it introduces a class of networks that are “structurally (mono) attractive” meaning that they are incapable of exhibiting multiple steady states, oscillation, or chaos by virtue of their reaction graphs. These networks are characterized by the existence of a universal energy-like function called a Robust Lyapunov function (RLF). To find such functions, a finite set of rank-one linear systems is introduced, which form the extremals of a linear convex cone. The problem is then reduced to that of finding a common Lyapunov function for this set of extremals. Based on this characterization, a computational package, Lyapunov-Enabled Analysis of Reaction Networks (LEARN), is provided that constructs such functions or rules out their existence. An extensive study of biochemical networks demonstrates that LEARN offers a new unified framework. Basic motifs, three-body binding, and genetic networks are studied first. The work then focuses on cellular signalling networks including various post-translational modification cascades, phosphotransfer and phosphorelay networks, T-cell kinetic proofreading, and ERK signalling. The Ribosome Flow Model is also studied.

Highlights

  • Many biological systems are known for the ability to operate precisely and consistently subject to potentially large disruptions and uncertainties [1,2,3,4,5]

  • A theoretical and computational framework is developed for the identification of biochemical networks that are “structurally attractive”

  • Many relevant networks in molecular biology satisfy the assumptions, and some are analyzed for the first time

Read more

Summary

Introduction

Many biological systems are known for the ability to operate precisely and consistently subject to potentially large disruptions and uncertainties [1,2,3,4,5]. The exact form and parameters (i.e., kinetics) that determine the speed of transformation of reactants into products are often unknown This lack of information is a barrier to the construction of complete mathematical models of biochemical dynamics. The ability to draw conclusions regarding the qualitative behavior of such networks without knowledge of their kinetics is highly relevant, and has been advocated under the banner of “complex biology without parameters” [4]. This fundamental difficulty led to statements such as Glass and Kauffman’s 1973 assertion that “it has proved impossible to develop general techniques which may be applied to find the asymptotic behavior of complex chemical systems” [7]

Methods
Results
Discussion
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.