Systems-Theoretic Approaches to Design Biological Networks with Desired Functionalities

Homeostasis in networks with multiple inputs

Homeostasis, also known as adaptation, refers to the ability of a system to counteract persistent external disturbances and tightly control the output of a key observable. Existing studies on homeostasis in network dynamics have mainly focused on 'perfect adaptation' in deterministic single-input single-output networks where the disturbances are scalar and affect the network dynamics via a pre-specified input node. In this paper we provide a full classification of all possible network topologies capable of generating infinitesimal homeostasis in arbitrarily large and complex multiple inputs networks. Working in the framework of 'infinitesimal homeostasis' allows us to make no assumption about how the components are interconnected and the functional form of the associated differential equations, apart from being compatible with the network architecture. Remarkably, we show that there are just three distinct 'mechanisms' that generate infinitesimal homeostasis. Each of these three mechanisms generates a rich class of well-defined network topologies-called homeostasis subnetworks. More importantly, we show that these classes of homeostasis subnetworks provides a topological basis for the classification of 'homeostasis types': the full set of all possible multiple inputs networks can be uniquely decomposed into these special homeostasis subnetworks. We illustrate our results with some simple abstract examples and a biologically realistic model for the co-regulation of calcium ( Ca ) and phosphate ( PO 4 ) in the rat. Furthermore, we identify a new phenomenon that occurs in the multiple input setting, that we call homeostasis mode interaction, in analogy with the well-known characteristic of multiparameter bifurcation theory.

Design Principles for Biological Adaptation: A Systems and Control-Theoretic Treatment

Establishing a mapping between (from and to) the functionality of interest and the underlying network structure (design principles) remains a crucial step toward understanding and design of bio-systems. Perfect adaptation is one such crucial functionality that enables every living organism to regulate its essential activities in the presence of external disturbances. Previous approaches to deducing the design principles for adaptation have either relied on computationally burdensome brute-force methods or rule-based design strategies detecting only a subset of all possible adaptive network structures. This chapter outlines a scalable and generalizable method inspired by systems theory that unravels an exhaustive set of adaptation-capable structures. We first use the well-known performance parameters to characterize perfect adaptation. These performance parameters are then mapped back to a few parameters (poles, zeros, gain) characteristic of the underlying dynamical system constituted by the rate equations. Therefore, the performance parameters evaluated for the scenario of perfect adaptation can be expressed as a set of precise mathematical conditions involving the system parameters. Finally, we use algebraic graph theory to translate these abstract mathematical conditions to certain structural requirements for adaptation. The proposed algorithm does not assume any particular dynamics and is applicable to networks of any size. Moreover, the results offer a significant advancement in the realm of understanding and designing complex biochemical networks.

On biological networks capable of robust adaptation in the presence of uncertainties: A linear systems-theoretic approach

Biological adaptation, the tendency of every living organism to regulate its essential activities in environmental fluctuations, is a well-studied functionality in systems and synthetic biology. In this work, we present a generic methodology inspired by systems theory to discover the design principles for robust adaptation, perfect and imperfect, in two different contexts: (1) in the presence of deterministic external and parametric disturbances and (2) in a stochastic setting. In all the cases, firstly, we translate the necessary qualitative conditions for adaptation to mathematical constraints using the language of systems theory, which we then map back as design requirements for the underlying networks. Thus, contrary to the existing approaches, the proposed methodologies provide an exhaustive set of admissible network structures without resorting to computationally burdensome brute-force techniques. Further, the proposed frameworks do not assume prior knowledge about the particular rate kinetics, thereby validating the conclusions for a large class of biological networks. In the deterministic setting, we show that unlike the incoherent feed-forward network structures (IFFLP or opposer modules), the modules containing negative feedback with buffer action (NFBLB or balancer modules) are robust to parametric fluctuations when a specific part of the network is assumed to remain unaffected. To this end, we propose a sufficient condition for imperfect adaptation and show that adding negative feedback in an IFFLP topology improves the robustness concerning parametric fluctuations. Further, we propose a stricter set of necessary conditions for imperfect adaptation. Turning to the stochastic scenario, we adopt a Wiener-Kolmogorov filter strategy to tune the parameters of a given network structure towards minimum output variance. We show that both NFBLB and IFFLP can be used as a reduced-order W-K filter. Further, we define the notion of nearest neighboring motifs to compare the output variances across different network structures. We argue that the NFBLB achieves adaptation at the cost of a variance higher than its nearest neighboring motifs whereas the IFFLP topology produces locally minimum variance while compared with its nearest neighboring motifs. We present numerical simulations to support the theoretical results. Overall, our results present a generic, systematic, and robust framework for advancing the understanding of complex biological networks.

Discovering adaptation-capable biological network structures using control-theoretic approaches

Constructing biological networks capable of performing specific biological functionalities has been of sustained interest in synthetic biology. Adaptation is one such ubiquitous functional property, which enables every living organism to sense a change in its surroundings and return to its operating condition prior to the disturbance. In this paper, we present a generic systems theory-driven method for designing adaptive protein networks. First, we translate the necessary qualitative conditions for adaptation to mathematical constraints using the language of systems theory, which we then map back as ‘design requirements’ for the underlying networks. We go on to prove that a protein network with different input–output nodes (proteins) needs to be at least of third-order in order to provide adaptation. Next, we show that the necessary design principles obtained for a three-node network in adaptation consist of negative feedback or a feed-forward realization. We argue that presence of a particular class of negative feedback or feed-forward realization is necessary for a network of any size to provide adaptation. Further, we claim that the necessary structural conditions derived in this work are the strictest among the ones hitherto existed in the literature. Finally, we prove that the capability of producing adaptation is retained for the admissible motifs even when the output node is connected with a downstream system in a feedback fashion. This result explains how complex biological networks achieve robustness while keeping the core motifs unchanged in the context of a particular functionality. We corroborate our theoretical results with detailed and thorough numerical simulations. Overall, our results present a generic, systematic and robust framework for designing various kinds of biological networks.

Biological systems display a remarkable diversity of functionalities, many of which can be conceived as the response of a large network composed of small interconnecting modules. Unravelling the connection pattern, i.e. design principles, behind important biological functionalities is one of the most challenging problems in systems biology. One such phenomenon is perfect adaptation, which merits special attention owing to its universal presence ranging from chemotaxis in bacterial cells to calcium homeostasis in mammalian cells. The present work focuses on finding the design principles for perfect adaptation in the presence of a stair-case type disturbance. To this end, the current work proposes a systems-theoretic approach to deduce precise mathematical (hence structural) conditions that comply with the key performance parameters for adaptation. The approach is agnostic to the particularities of the reaction kinetics, underlining the dominant role of the topological structure on the response of the network. Notably, the design principles obtained in this work serve as the most strict necessary structural conditions for a network of any size to provide perfect adaptation.