984 research outputs found

    Synthesis of Biological and Mathematical Methods for Gene Network Control

    Get PDF
    abstract: Synthetic biology is an emerging field which melds genetics, molecular biology, network theory, and mathematical systems to understand, build, and predict gene network behavior. As an engineering discipline, developing a mathematical understanding of the genetic circuits being studied is of fundamental importance. In this dissertation, mathematical concepts for understanding, predicting, and controlling gene transcriptional networks are presented and applied to two synthetic gene network contexts. First, this engineering approach is used to improve the function of the guide ribonucleic acid (gRNA)-targeted, dCas9-regulated transcriptional cascades through analysis and targeted modification of the RNA transcript. In so doing, a fluorescent guide RNA (fgRNA) is developed to more clearly observe gRNA dynamics and aid design. It is shown that through careful optimization, RNA Polymerase II (Pol II) driven gRNA transcripts can be strong enough to exhibit measurable cascading behavior, previously only shown in RNA Polymerase III (Pol III) circuits. Second, inherent gene expression noise is used to achieve precise fractional differentiation of a population. Mathematical methods are employed to predict and understand the observed behavior, and metrics for analyzing and quantifying similar differentiation kinetics are presented. Through careful mathematical analysis and simulation, coupled with experimental data, two methods for achieving ratio control are presented, with the optimal schema for any application being dependent on the noisiness of the system under study. Together, these studies push the boundaries of gene network control, with potential applications in stem cell differentiation, therapeutics, and bio-production.Dissertation/ThesisDoctoral Dissertation Biomedical Engineering 201

    Boolean Delay Equations: A simple way of looking at complex systems

    Full text link
    Boolean Delay Equations (BDEs) are semi-discrete dynamical models with Boolean-valued variables that evolve in continuous time. Systems of BDEs can be classified into conservative or dissipative, in a manner that parallels the classification of ordinary or partial differential equations. Solutions to certain conservative BDEs exhibit growth of complexity in time. They represent therewith metaphors for biological evolution or human history. Dissipative BDEs are structurally stable and exhibit multiple equilibria and limit cycles, as well as more complex, fractal solution sets, such as Devil's staircases and ``fractal sunbursts``. All known solutions of dissipative BDEs have stationary variance. BDE systems of this type, both free and forced, have been used as highly idealized models of climate change on interannual, interdecadal and paleoclimatic time scales. BDEs are also being used as flexible, highly efficient models of colliding cascades in earthquake modeling and prediction, as well as in genetics. In this paper we review the theory of systems of BDEs and illustrate their applications to climatic and solid earth problems. The former have used small systems of BDEs, while the latter have used large networks of BDEs. We moreover introduce BDEs with an infinite number of variables distributed in space (``partial BDEs``) and discuss connections with other types of dynamical systems, including cellular automata and Boolean networks. This research-and-review paper concludes with a set of open questions.Comment: Latex, 67 pages with 15 eps figures. Revised version, in particular the discussion on partial BDEs is updated and enlarge

    Stability Analysis of Delayed Genetic Regulatory Networks via a Relaxed Double Integral Inequality

    Get PDF
    Time delay arising in a genetic regulatory network may cause the instability. This paper is concerned with the stability analysis of genetic regulatory networks with interval time-varying delays. Firstly, a relaxed double integral inequality, named as Wirtinger-type double integral inequality (WTDII), is established to estimate the double integral term appearing in the derivative of Lyapunov-Krasovskii functional with a triple integral term. And it is proved theoretically that the proposed WTDII is tighter than the widely used Jensen-based double inequality and the recently developed Wiringter-based double inequality. Then, by applying the WTDII to the stability analysis of a delayed genetic regulatory network, together with the usage of useful information of regulatory functions, several delay-range- and delay-rate-dependent (or delay-rate-independent) criteria are derived in terms of linear matrix inequalities. Finally, an example is carried out to verify the effectiveness of the proposed method and also to show the advantages of the established stability criteria through the comparison with some literature

    Differential Equations arising from Organising Principles in Biology

    Get PDF
    This workshop brought together experts in modeling and analysis of organising principles of multiscale biological systems such as cell assemblies, tissues and populations. We focused on questions arising in systems biology and medicine which are related to emergence, function and control of spatial and inter-individual heterogeneity in population dynamics. There were three main areas represented of differential equation models in mathematical biology. The first area involved the mathematical description of structured populations. The second area concerned invasion, pattern formation and collective dynamics. The third area treated the evolution and adaptation of populations, following the Darwinian paradigm. These problems led to differential equations, which frequently are non-trivial extensions of classical problems. The examples included but were not limited to transport-type equations with nonlocal boundary conditions, mixed ODE-reaction-diffusion models, nonlocal diffusion and cross-diffusion problems or kinetic equations

    Dynamics of asynchronous random Boolean networks with asynchrony generated by stochastic processes

    Get PDF
    An asynchronous Boolean network with N nodes whose states at each time point are determined by certain parent nodes is considered. We make use of the models developed by Matache and Heidel [Matache, M.T., Heidel, J., 2005. Asynchronous random Boolean network model based on elementary cellular automata rule 126. Phys. Rev. E 71, 026232] for a constant number of parents, and Matache [Matache, M.T., 2006. Asynchronous random Boolean network model with variable number of parents based on elementary cellular automata rule 126. IJMPB 20 (8), 897–923] for a varying number of parents. In both these papers the authors consider an asynchronous updating of all nodes, with asynchrony generated by various random distributions. We supplement those results by using various stochastic processes as generators for the number of nodes to be updated at each time point. In this paper we use the following stochastic processes: Poisson process, random walk, birth and death process, Brownian motion, and fractional Brownian motion. We study the dynamics of the model through sensitivity of the orbits to initial values, bifurcation diagrams, and fixed-point analysis. The dynamics of the system show that the number of nodes to be updated at each time point is of great importance, especially for the random walk, the birth and death, and the Brownian motion processes. Small or moderate values for the number of updated nodes generate order, while large values may generate chaos depending on the underlying parameters. The Poisson process generates order. With fractional Brownian motion, as the values of the Hurst parameter increase, the system exhibits order for a wider range of combinations of the underlying parameters

    Mathematical modelling and brain dynamical networks

    Get PDF
    In this thesis, we study the dynamics of the Hindmarsh-Rose (HR) model which studies the spike-bursting behaviour of the membrane potential of a single neuron. We study the stability of the HR system and compute its Lyapunov exponents (LEs). We consider coupled general sections of the HR system to create an undirected brain dynamical network (BDN) of Nn neurons. Then, we study the concepts of upper bound of mutual information rate (MIR) and synchronisation measure and their dependence on the values of electrical and chemical couplings. We analyse the dynamics of neurons in various regions of parameter space plots for two elementary examples of 3 neurons with two different types of electrical and chemical couplings. We plot the upper bound Ic and the order parameter rho (the measure of synchronisation) and the two largest Lyapunov exponents LE1 and LE2 versus the chemical coupling gn and electrical coupling gl. We show that, even for small number of neurons, the dynamics of the system depends on the number of neurons and the type of coupling strength between them. Finally, we evolve a network of Hindmarsh-Rose neurons by increasing the entropy of the system. In particular, we choose the Kolmogorov-Sinai entropy: HKS (Pesin identity) as the evolution rule. First, we compute the HKS for a network of 4 HR neurons connected simultaneously by two undirected electrical and two undirected chemical links. We get different entropies with the use of different values for both the chemical and electrical couplings. If the entropy of the system is positive, the dynamics of the system is chaotic and if it is close to zero, the trajectory of the system converges to one of the fixed points and loses energy. Then, we evolve a network of 6 clusters of 10 neurons each. Neurons in each cluster are connected only by electrical links and their connections form small-world networks. The six clusters connect to each other only by chemical links. We compare between the combined effect of chemical and electrical couplings with the two concepts, the information flow capacity Ic and HKS in evolving the BDNs and show results that the brain networks might evolve based on the principle of the maximisation of their entropies

    Monotone and near-monotone biochemical networks

    Get PDF
    Monotone subsystems have appealing properties as components of larger networks, since they exhibit robust dynamical stability and predictability of responses to perturbations. This suggests that natural biological systems may have evolved to be, if not monotone, at least close to monotone in the sense of being decomposable into a “small” number of monotone components, In addition, recent research has shown that much insight can be attained from decomposing networks into monotone subsystems and the analysis of the resulting interconnections using tools from control theory. This paper provides an expository introduction to monotone systems and their interconnections, describing the basic concepts and some of the main mathematical results in a largely informal fashion
    • 

    corecore