4.3 Article

Automated Synthesis and Analysis of Switching Gene Regulatory Networks

期刊

BIOSYSTEMS
卷 146, 期 -, 页码 26-34

出版社

ELSEVIER SCI LTD
DOI: 10.1016/j.biosystems.2016.03.012

关键词

Gene regulatory networks (GRNs); Boolean networks (BNs); Biological modelling; Satisfiability Modulo Theories (SMT); Synthesis; Self-modifying code; Cell fate; Mammalian cortex

资金

  1. Cambridge International Scholarship Scheme (CISS)
  2. MRC [MR/L023784/2, MR/L023784/1] Funding Source: UKRI

向作者/读者索取更多资源

Studying the gene regulatory networks (GRNs) that govern how cells change into specific cell types with unique roles throughout development is an active area of experimental research. The fate specification process can be viewed as a biological program prescribing the system dynamics, governed by a network of genetic interactions. To investigate the possibility that GRNs are not fixed but rather change their topology, for example as cells progress through commitment, we introduce the concept of Switching Gene Regulatory Networks (SGRNs) to enable the modelling and analysis of network reconfiguration. We define the synthesis problem of constructing SGRNs that are guaranteed to satisfy a set of constraints representing experimental observations of cell behaviour. We propose a solution to this problem that employs methods based upon Satisfiability Modulo Theories (SMT) solvers, and evaluate the feasibility and scalability of our approach by considering a set of synthetic benchmarks exhibiting possible biological behaviour of cell development. We outline how our approach is applied to a more realistic biological system, by considering a simplified network involved in the processes of neuron maturation and fate specification in the mammalian cortex. (C) 2016 The Authors. Published by Elsevier Ireland Ltd.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.3
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据