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.

Sloppiness: Fundamental study, new formalism and its application in model assessment

Computational modelling of biological processes poses multiple challenges in each stage of the modelling exercise. Some significant challenges include identifiability, precisely estimating parameters from limited data, informative experiments and anisotropic sensitivity in the parameter space. One of these challenges' crucial but inconspicuous sources is the possible presence of large regions in the parameter space over which model predictions are nearly identical. This property, known as sloppiness, has been reasonably well-addressed in the past decade, studying its possible impacts and remedies. However, certain critical unanswered questions concerning sloppiness, particularly related to its quantification and practical implications in various stages of system identification, still prevail. In this work, we systematically examine sloppiness at a fundamental level and formalise two new theoretical definitions of sloppiness. Using the proposed definitions, we establish a mathematical relationship between the parameter estimates' precision and sloppiness in linear predictors. Further, we develop a novel computational method and a visual tool to assess the goodness of a model around a point in parameter space by identifying local structural identifiability and sloppiness and finding the most sensitive and least sensitive parameters for non-infinitesimal perturbations. We demonstrate the working of our method in benchmark systems biology models of various complexities. The pharmacokinetic HIV infection model analysis identified a new set of biologically relevant parameters that can be used to control the free virus in an active HIV infection.

Discovering design principles for biological functionalities:Perspectives from systems biology

Network architecture plays a crucial role in governing the dynamics of any biological network. Further, network structures have been shown to remain conserved across organisms for a given phenotype. Therefore, the mapping between network structures and the output functionality not only aids in understanding of biological systems but also finds application in synthetic biology and therapeutics. Based on the approaches involved, most of the efforts hitherto invested in this field can be classified into three broad categories, namely, computational efforts, rule-based methods and systems-theoretic approaches. The present review provides a qualitative and quantitative study of all three approaches in the light of three well-researched biological phenotypes, namely, oscillation, toggle switching, and adaptation. We also discuss the advantages, limitations, and future research scope for all three approaches along with their possible applications to other emergent properties of biological relevance.

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.

A prediction framework with time-frequency localization feature for detecting the onset of seismic events

Onset detection of P-wave in seismic signals is of vital importance to seismologists because it is not only crucial to the development of early warning systems but it also aids in estimating the seismic source parameters. All the existing P-wave onset detection methods are based on a combination of statistical signal processing and time-series modeling ideas. However, these methods do not adequately accommodate some advanced ideas that exist in fault detection literature, especially those based on predictive analytics. When combined with a time-frequency (t-f) / temporal-spectral localization method, the effectiveness of such methods is enhanced significantly. This work proposes a novel real-time automatic P-wave detector and picker in the prediction framework with a time-frequency localization feature. The proposed approach brings a diverse set of capabilities in accurately detecting the P-wave onset, especially in low signal-to-noise ratio (SNR) conditions that all the existing methods fail to attain. The core idea is to monitor the difference in squared magnitudes of one-step-ahead predictions and measurements in the time-frequency bands with a statistically determined threshold. The proposed framework essentially accommodates any suitable prediction methodology and time-frequency transformation. We demonstrate the proposed framework by deploying auto-regressive integrated moving average (ARIMA) models for predictions and the well-known maximal overlap discrete wavelet packet transform (MODWPT) for the t-f projection of measurements. The ability and efficacy of the proposed method, especially in detecting P-waves embedded in low SNR measurements, is illustrated on a synthetic data set and 200 real-time data sets spanning four different geographical regions. A comparison with three prominently used detectors, namely, STA/LTA, AIC, and DWT-AIC, shows improved detection rate for low SNR events, better accuracy of detection and picking, decreased false alarm rate, and robustness to outliers in data. Specifically, the proposed method yields a detection rate of 89% and a false alarm rate of 11.11%, which are significantly better than those of existing methods.

Systems-Theoretic Approaches to Design Biological Networks with Desired Functionalities

The deduction of design principles for complex biological functionalities has been a source of constant interest in the fields of systems and synthetic biology. A number of approaches have been adopted, to identify the space of network structures or topologies that can demonstrate a specific desired functionality, ranging from brute force to systems theory-based methodologies. The former approach involves performing a search among all possible combinations of network structures, as well as the parameters underlying the rate kinetics for a given form of network. In contrast to the search-oriented approach in brute force studies, the present chapter introduces a generic approach inspired by systems theory to deduce the network structures for a particular biological functionality. As a first step, depending on the functionality and the type of network in consideration, a measure of goodness of attainment is deduced by defining performance parameters. These parameters are computed for the most ideal case to obtain the necessary condition for the given functionality. The necessary conditions are then mapped as specific requirements on the parameters of the dynamical system underlying the network. Following this, admissible minimal structures are deduced. The proposed methodology does not assume any particular rate kinetics in this case for deducing the admissible network structures notwithstanding a minimum set of assumptions on the rate kinetics. The problem of computing the ideal set of parameter/s or rate constants, unlike the problem of topology identification, depends on the particular rate kinetics assumed for the given network. In this case, instead of a computationally exhaustive brute force search of the parameter space, a topology-functionality specific optimization problem can be solved. The objective function along with the feasible region bounded by the motif specific constraints amounts to solving a non-convex optimization program leading to non-unique parameter sets. To exemplify our approach, we adopt the functionality of adaptation, and demonstrate how network topologies that can achieve adaptation can be identified using such a systems-theoretic approach. The outcomes, in this case, i.e., minimum network structures for adaptation, are in agreement with the brute force results and other studies in literature.

Scalar correlation functions for model structure selection in high-dimensional time-series modelling

Model structure selection is an important step in high-dimensional time-series modelling. Traditionally AIC and BIC have been used for this purpose, however, only post model estimation. On the other hand, modern approaches use penalized regression methods, but the optimization is in a user-specified model class. In this work, we propose a pre-estimation approach based on two novel correlation functions, namely, the scalar autocorrelation function (SACF) and the scalar inverse autocorrelation function (SIACF) for identifying the appropriate model class among the vector autoregressive (VAR), vector moving average (VMA), and mixed (VARMA) classes. In addition, these scalar functions theoretically provide the exact order of VAR and VMA processes, and are computationally feather light even for high-dimensional series. The proposed functions are obtained through two linear constructs of the given multivariate process with a lagged-correlation equivalence constraint. The key benefit is that only two correlation functions need to be examined as against the standard M² correlation and M² inverse (or partial) correlation plots for an M-dimensional process. This benefit extends to conducting whiteness test in multivariate time-series modelling and is particularly pronounced under small sample conditions, wherein parsimony, structure and class of the identified model is crucial in achieving efficient estimates. Theoretical proofs and case studies are presented to establish the properties and to demonstrate the utility of proposed correlation functions.

Correntropy-based partial directed coherence for testing multivariate Granger causality in nonlinear processes

Identification of directional influences in multivariate systems is of prime importance in several applications of engineering and sciences such as plant topology reconstruction, fault detection and diagnosis, and neurosciences. A spectrum of related directionality measures, ranging from linear measures such as partial directed coherence (PDC) to nonlinear measures such as transfer entropy, have emerged over the past two decades. The PDC-based technique is simple and effective, but being a linear directionality measure has limited applicability. On the other hand, transfer entropy, despite being a robust nonlinear measure, is computationally intensive and practically implementable only for bivariate processes. The objective of this work is to develop a nonlinear directionality measure, termed as KPDC, that possesses the simplicity of PDC but is still applicable to nonlinear processes. The technique is founded on a nonlinear measure called correntropy, a recently proposed generalized correlation measure. The proposed method is equivalent to constructing PDC in a kernel space where the PDC is estimated using a vector autoregressive model built on correntropy. A consistent estimator of the KPDC is developed and important theoretical results are established. A permutation scheme combined with the sequential Bonferroni procedure is proposed for testing hypothesis on absence of causality. It is demonstrated through several case studies that the proposed methodology effectively detects Granger causality in nonlinear processes.

Quantitative analysis of directional strengths in jointly stationary linear multivariate processes

Identification and analysis of directed influences in multivariate systems is an important problem in many scientific areas. Recent studies in neuroscience have provided measures to determine the network structure of the process and to quantify the total effect in terms of energy transfer. These measures are based on joint stationary representations of a multivariate process using vector auto-regressive (VAR) models. A few important issues remain unaddressed though. The primary outcomes of this study are (i) a theoretical proof that the total coupling strength consists of three components, namely, the direct, indirect, and the interference produced by the direct and indirect effects, (ii) expressions to estimate/calculate these effects, and (iii) a result which shows that the well-known directed measure for linear systems, partial directed coherence (PDC) only aids in structure determination but does not provide a normalized measure of the direct energy transfer. Simulation case studies are shown to illustrate the theoretical results.