Preservation of dynamic properties in qualitative modeling frameworks for gene regulatory networks

Mathematical modeling often helps to provide a systems perspective on gene regulatory networks. In particular, qualitative approaches are useful when detailed kinetic information is lacking. Multiple methods have been developed that implement qualitative information in different ways, e.g., in purely discrete or hybrid discrete/continuous models. In this paper, we compare the discrete asynchronous logical modeling formalism for gene regulatory networks due to R. Thomas with piecewise affine differential equation models. We provide a local characterization of the qualitative dynamics of a piecewise affine differential equation model using the discrete dynamics of a corresponding Thomas model. Based on this result, we investigate the consistency of higher-level dynamical properties such as attractor characteristics and reachability. We show that although the two approaches are based on equivalent information, the resulting qualitative dynamics are different. In particular, the dynamics of the piecewise affine differential equation model is not a simple refinement of the dynamics of the Thomas model     

Discrete time piecewise affine models of genetic regulatory networks

We introduce simple models of genetic regulatory networks and we proceed to the mathematical analysis of their dynamics. The models are discrete time dynamical systems generated by piecewise affine contracting mappings whose variables represent gene expression levels. These models reduce to boolean networks in one limiting case of a parameter, and their asymptotic dynamics approaches that of a differential equation in another limiting case of this parameter. For intermediate values, the model present an original phenomenology which is argued to be due to delay effects. This phenomenology is not limited to piecewise affine model but extends to smooth nonlinear discrete time models of regulatory networks. In a first step, our analysis concerns general properties of networks on arbitrary graphs (characterisation of the attractor, symbolic dynamics, Lyapunov stability, structural stability, symmetries, etc). In a second step, focus is made on simple circuits for which the attractor and its changes with parameters are described. In the negative circuit of 2 genes, a thorough study is presented which concern stable (quasi-)periodic oscillations governed by rotations on the unit circle – with a rotation number depending continuously and monotonically on threshold parameters. These regular oscillations exist in negative circuits with arbitrary number of genes where they are most likely to be observed in genetic systems with non-negligible delay effects.     

Comparing Boolean and Piecewise Affine Differential Models for Genetic Networks

Multi-level discrete models of genetic networks, or the more general piecewise affine differential models, provide qualitative information on the dynamics of the system, based on a small number of parameters (such as synthesis and degradation rates). Boolean models also provide qualitative information, but are based simply on the structure of interconnections. To explore the relationship between the two formalisms, a piecewise affine differential model and a Boolean model are compared, for the carbon starvation response network in E. coli. The asymptotic dynamics of both models are shown to be quite similar. This study suggests new tools for analysis and reduction of biological networks.     

Modeling the topological organization of cellular processes

The cell as a dynamical system presents the characteristics of having a dynamical structure. That is, the exact phase space of the system cannot be fixed before the evolution and integrative cell models must state the evolution of the structure jointly with the evolution of the cell state. This kind of dynamical systems is very challenging to model and simulate. New programming concepts must be developed to ease their modeling and simulation. In this context, the goal of the MGS project is to develop an experimental programming language dedicated to the simulation of this kind of systems. MGS proposes a unified view on several computational mechanisms (CHAM, Lindenmayer systems, Paun systems, cellular automata) enabling the specification of spatially localized computations on heterogeneous entities. The evolution of a dynamical structure is handled through the concept of transformation which relies on the topological organization of the system components. An example based on the modeling of spatially distributed biochemical networks is used to illustrate how these notions can be used to model the spatial and temporal organization of intracellular processes.     

Symbolic reachable set computation of piecewise affine hybrid automata and its application to biological modelling: Delta-Notch protein signalling

Hybrid automata are an eminently suitable modelling framework for biological protein regulatory networks, as the protein concentration dynamics inside each biological cell are modelled using linear differential equations; inputs activate or deactivate these continuous dynamics through discrete switches, which themselves are controlled by protein concentrations reaching given thresholds. This paper proposes an iterative refinement algorithm for computing discrete abstractions of a class of hybrid automata with piecewise affine continuous dynamics and forced discrete transitions, defined completely in terms of symbolic variables and parameters. Furthermore, these discrete abstractions are utilised to compute symbolic parametric backward reachable sets from the equilibria of the hybrid automata, that are guaranteed to be exact or conservative under-approximations. The algorithm is then implemented using MATLAB and QEPCAD, to compute reachable sets for the biologically observed equilibria of the multiple cell Delta-Notch protein signalling automaton with symbolic parameters. The results are analysed to show that novel, non-intuitive, and biologically interesting properties can be deduced from the reachability computation, thus demonstrating the utility of the algorithm.     

Critical thresholds for eventual extinction in randomly disturbed population growth models

This paper considers several single species growth models featuring a carrying capacity, which are subject to random disturbances that lead to instantaneous population reduction at the disturbance times. This is motivated in part by growing concerns about the impacts of climate change. Our main goal is to understand whether or not the species can persist in the long run. We consider the discrete-time stochastic process obtained by sampling the system immediately after the disturbances, and find various thresholds for several modes of convergence of this discrete process, including thresholds for the absence or existence of a positively supported invariant distribution. These thresholds are given explicitly in terms of the intensity and frequency of the disturbances on the one hand, and the population’s growth characteristics on the other. We also perform a similar threshold analysis for the original continuous-time stochastic process, and obtain a formula that allows us to express the invariant distribution for this continuous-time process in terms of the invariant distribution of the discrete-time process, and vice versa. Examples illustrate that these distributions can differ, and this sends a cautionary message to practitioners who wish to parameterize these and related models using field data. Our analysis relies heavily on a particular feature shared by all the deterministic growth models considered here, namely that their solutions exhibit an exponentially weighted averaging property between a function of the initial condition, and the same function applied to the carrying capacity. This property is due to the fact that these systems can be transformed into affine systems.

     

Brain mechanisms linking language and action

For a long time the cortical systems for language and actions were believed to be independent modules. However, as these systems are reciprocally connected with each other, information about language and actions might interact in distributed neuronal assemblies. A critical case is that of action words that are semantically related to different parts of the body (for example, 'lick', 'pick' and 'kick'): does the comprehension of these words specifically, rapidly and automatically activate the motor system in a somatotopic manner, and does their comprehension rely on activity in the action system?     

Hierarchical analysis of piecewise affine models of gene regulatory networks

A key point in the analysis of dynamical models of biological systems is to handle systems of relatively high dimensions. In the present paper we propose a method to hierarchically organize a certain type of piecewise affine (PWA) differential systems. This specific class of systems has been extensively studied for the past few years, as it provides a good framework to model gene regulatory networks. The method, shown on several examples, allows a qualitative analysis of the asymptotic behavior of a PWA system, decomposing it into several smaller subsystems. This technique, based on the well-known strongly connected components decomposition, is not new. However, its adaptation to the non-smooth PWA differential equations turns out to be quite relevant because of the strong discrete structure underlying these equations. Its biological relevance is shown on a 7-dimensional PWA system modeling the gene network responsible for the carbon starvation response in Escherichia coli.

---

Chaos and language

Human language is a complex communication system with unlimited expressibility. Children spontaneously develop a native language by exposure to linguistic data from their speech community. Over historical time, languages change dramatically and unpredictably by accumulation of small changes and by interaction with other languages. We have previously developed a mathematical model for the acquisition and evolution of language in heterogeneous populations of speakers. This model is based on game dynamical equations with learning. Here, we show that simple examples of such equations can display complex limit cycles and chaos. Hence, language dynamical equations mimic complicated and unpredictable changes of languages over time. In terms of evolutionary game theory, we note that imperfect learning can induce chaotic switching among strict Nash equilibria.     

Small worlds and semantic network growth in typical and late talkers

Network analysis has demonstrated that systems ranging from social networks to electric power grids often involve a small world structure-with local clustering but global ac cess. Critically, small world structure has also been shown to characterize adult human semantic networks. Moreover, the connectivity pattern of these mature networks is consistent with lexical growth processes in which children add new words to their vocabulary based on the structure of the language-learning environment. However, thus far, there is no direct evidence that a child's individual semantic network structure is associated with their early language learning. Here we show that, while typically developing children's early networks show small world structure as early as 15 months and with as few as 55 words, children with language delay (late talkers) have this structure to a smaller degree. This implicates a maladaptive bias in word acquisition for late talkers, potentially indicating a preference for "oddball" words. The findings provide the first evidence of a link between small-world connectivity and lexical development in individual children.     

Engineering entrainment and adaptation in limit cycle systems

Periodic behavior is key to life and is observed in multiple instances and at multiple time scales in our metabolism, our natural environment, and our engineered environment. A natural way of modeling or generating periodic behavior is done by using oscillators, i.e., dynamical systems that exhibit limit cycle behavior. While there is extensive literature on methods to analyze such dynamical systems, much less work has been done on methods to synthesize an oscillator to exhibit some specific desired characteristics. The goal of this article is twofold: (1) to provide a framework for characterizing and designing oscillators and (2) to review how classes of well-known oscillators can be understood and related to this framework. The basis of the framework is to characterize oscillators in terms of their fundamental temporal and spatial behavior and in terms of properties that these two behaviors can be designed to exhibit. This focus on fundamental properties is important because it allows us to systematically compare a large variety of oscillators that might at first sight appear very different from each other. We identify several specifications that are useful for design, such as frequency-locking behavior, phase-locking behavior, and specific output signal shape. We also identify two classes of design methods by which these specifications can be met, namely offline methods and online methods. By relating these specifications to our framework and by presenting several examples of how oscillators have been designed in the literature, this article provides a useful methodology and toolbox for designing oscillators for a wide range of purposes. In particular, the focus on synthesis of limit cycle dynamical systems should be useful both for engineering and for computational modeling of physical or biological phenomena.     

How to reach linguistic consensus: a proof of convergence for the naming game

In this paper we introduce a mathematical model of naming games. Naming games have been widely used within research on the origins and evolution of language. Despite the many interesting empirical results these studies have produced, most of this research lacks a formal elucidating theory. In this paper we show how a population of agents can reach linguistic consensus, i.e. learn to use one common language to communicate with one another. Our approach differs from existing formal work in two important ways: one, we relax the too strong assumption that an agent samples infinitely often during each time interval. This assumption is usually made to guarantee convergence of an empirical learning process to a deterministic dynamical system. Two, we provide a proof that under these new realistic conditions, our model converges to a common language for the entire population of agents. Finally the model is experimentally validated.     

Controllability of non-linear biochemical systems

Mathematical methods of biochemical pathway analysis are rapidly maturing to a point where it is possible to provide objective rationale for the natural design of metabolic systems and where it is becoming feasible to manipulate these systems based on model predictions, for instance, with the goal of optimizing the yield of a desired microbial product. So far, theory-based metabolic optimization techniques have mostly been applied to steady-state conditions or the minimization of transition time, using either linear stoichiometric models or fully kinetic models within biochemical systems theory (BST). This article addresses the related problem of controllability, where the task is to steer a non-linear biochemical system, within a given time period, from an initial state to some target state, which may or may not be a steady state. For this purpose, BST models in S-system form are transformed into affine non-linear control systems, which are subjected to an exact feedback linearization that permits controllability through independent variables. The method is exemplified with a small glycolytic-glycogenolytic pathway that had been analyzed previously by several other authors in different contexts.     

生态阈值确定方法综述

生态系统在环境条件变化时表现出的剧变或阈值现象是当前生态学研究的热点,但是生态阈值定量检测的困难阻碍了这一主题的研究与应用。本文从典型案例入手,通过分析潜在生态阈值的S型曲线式、补给-压力式和跃迁式驱动-响应机理,归纳了局部加权回归散点平滑法、分段回归、高斯模型、拐点分析软件、稳态转换检测软件、指示种阈值分析和系统动力学仿真模型7种生态阈值确定方法,并评述了其优缺点和适用性,以期为生态阈值的定量分析研究提供方法借鉴。     

BIOSMILE: A semantic role labeling system for biomedical verbs using a maximum-entropy model with automatically generated template features

Background  

Bioinformatics tools for automatic processing of biomedical literature are invaluable for both the design and interpretation of large-scale experiments. Many information extraction (IE) systems that incorporate natural language processing (NLP) techniques have thus been developed for use in the biomedical field. A key IE task in this field is the extraction of biomedical relations, such as protein-protein and gene-disease interactions. However, most biomedical relation extraction systems usually ignore adverbial and prepositional phrases and words identifying location, manner, timing, and condition, which are essential for describing biomedical relations. Semantic role labeling (SRL) is a natural language processing technique that identifies the semantic roles of these words or phrases in sentences and expresses them as predicate-argument structures. We construct a biomedical SRL system called BIOSMILE that uses a maximum entropy (ME) machine-learning model to extract biomedical relations. BIOSMILE is trained on BioProp, our semi-automatic, annotated biomedical proposition bank. Currently, we are focusing on 30 biomedical verbs that are frequently used or considered important for describing molecular events.