scholarly journals Comparison of Gene Regulatory Networks via Steady-State Trajectories

2007 ◽  
Vol 2007 ◽  
pp. 1-11 ◽  
Author(s):  
Marcel Brun ◽  
Seungchan Kim ◽  
Woonjung Choi ◽  
Edward R. Dougherty
2020 ◽  
Vol 36 (19) ◽  
pp. 4885-4893 ◽  
Author(s):  
Baoshan Ma ◽  
Mingkun Fang ◽  
Xiangtian Jiao

Abstract Motivation Gene regulatory networks (GRNs) capture the regulatory interactions between genes, resulting from the fundamental biological process of transcription and translation. In some cases, the topology of GRNs is not known, and has to be inferred from gene expression data. Most of the existing GRNs reconstruction algorithms are either applied to time-series data or steady-state data. Although time-series data include more information about the system dynamics, steady-state data imply stability of the underlying regulatory networks. Results In this article, we propose a method for inferring GRNs from time-series and steady-state data jointly. We make use of a non-linear ordinary differential equations framework to model dynamic gene regulation and an importance measurement strategy to infer all putative regulatory links efficiently. The proposed method is evaluated extensively on the artificial DREAM4 dataset and two real gene expression datasets of yeast and Escherichia coli. Based on public benchmark datasets, the proposed method outperforms other popular inference algorithms in terms of overall score. By comparing the performance on the datasets with different scales, the results show that our method still keeps good robustness and accuracy at a low computational complexity. Availability and implementation The proposed method is written in the Python language, and is available at: https://github.com/lab319/GRNs_nonlinear_ODEs Supplementary information Supplementary data are available at Bioinformatics online.


PLoS ONE ◽  
2013 ◽  
Vol 8 (8) ◽  
pp. e72103 ◽  
Author(s):  
Yi Kan Wang ◽  
Daniel G. Hurley ◽  
Santiago Schnell ◽  
Cristin G. Print ◽  
Edmund J. Crampin

2005 ◽  
Vol 232 (3) ◽  
pp. 427-441 ◽  
Author(s):  
Michael Andrec ◽  
Boris N. Kholodenko ◽  
Ronald M. Levy ◽  
Eduardo Sontag

Author(s):  
Pencho Yordanov ◽  
Joerg Stelling ◽  
Irene Otero-Muras

Abstract Motivation Multi-steady state behaviour, and in particular multi-stability, provides biological systems with the capacity to take reliable decisions (such as cell fate determination). A problem arising frequently in systems biology is to elucidate whether a signal transduction mechanism or a gene regulatory network has the capacity for multi-steady state behaviour, and consequently for a switch-like response to stimuli. Bifurcation diagrams are a powerful instrument in non-linear analysis to study the qualitative and quantitative behaviour of equilibria including bifurcation into different equilibrium branches and bistability. However, in the context of signalling pathways, the inherent large parametric uncertainty hampers the (direct) use of standard bifurcation tools. Results We present BioSwitch, a toolbox to detect multi-steady state behaviour in signalling pathways and gene regulatory networks. The tool combines results from chemical reaction network theory with global optimization to efficiently detect whether a signalling pathway has the capacity to undergo a saddle node bifurcation, and in case of multi-stationarity, provides the exact coordinates of the bifurcation where to start a numerical continuation analysis with standard bifurcation tools, leading to two different branches of equilibria. Bistability detection in the G1/S transition pathway of Saccharomyces cerevisiae is included as an illustrative example. Availability and implementation BioSwitch runs under the popular MATLAB computational environment, and is available at https://sites.google.com/view/bioswitch.


Author(s):  
Anthony Almudevar ◽  
Matthew N. McCall ◽  
Helene McMurray ◽  
Hartmut Land

Gene perturbation experiments are commonly used for the reconstruction of gene regulatory networks. Typical experimental methodology imposes persistent changes on the network. The resulting data must therefore be interpreted as a steady state from an altered gene regulatory network, rather than a direct observation of the original network. In this article an implicit modeling methodology is proposed in which the unperturbed network of interest is scored by first modeling the persistent perturbation, then predicting the steady state, which may then be compared to the observed data. This results in a many-to-one inverse problem, so a computational Bayesian approach is used to assess model uncertainty.The methodology is first demonstrated on a number of synthetic networks. It is shown that the Bayesian approach correctly assigns high posterior probability to the network structure and steady state behavior. Further, it is demonstrated that where uncertainty of model features is indicated, the uncertainty may be accurately resolved with further perturbation experiments. The methodology is then applied to the modeling of a gene regulatory network using perturbation data from nine genes which have been shown to respond synergistically to known oncogenic mutations. A hypothetical model emerges which conforms to reported regulatory properties of these genes. Furthermore, the Bayesian methodology is shown to be consistent in the sense that multiple randomized applications of the fitting algorithm converge to an approximately common posterior density on the space of models. Such consistency is generally not feasible for algorithms which report only single models. We conclude that fully Bayesian methods, coupled with models which accurately account for experimental constraints, are a suitable tool for the inference of gene regulatory networks, in terms of accuracy, estimation of model uncertainty, and experimental design.


Sign in / Sign up

Export Citation Format

Share Document