Analysis of gene network robustness based on saturated fixed point attractors.

Genyuan Li, Herschel Rabitz
{"title":"Analysis of gene network robustness based on saturated fixed point attractors.","authors":"Genyuan Li,&nbsp;Herschel Rabitz","doi":"10.1186/1687-4153-2014-4","DOIUrl":null,"url":null,"abstract":"<p><p>The analysis of gene network robustness to noise and mutation is important for fundamental and practical reasons. Robustness refers to the stability of the equilibrium expression state of a gene network to variations of the initial expression state and network topology. Numerical simulation of these variations is commonly used for the assessment of robustness. Since there exists a great number of possible gene network topologies and initial states, even millions of simulations may be still too small to give reliable results. When the initial and equilibrium expression states are restricted to being saturated (i.e., their elements can only take values 1 or -1 corresponding to maximum activation and maximum repression of genes), an analytical gene network robustness assessment is possible. We present this analytical treatment based on determination of the saturated fixed point attractors for sigmoidal function models. The analysis can determine (a) for a given network, which and how many saturated equilibrium states exist and which and how many saturated initial states converge to each of these saturated equilibrium states and (b) for a given saturated equilibrium state or a given pair of saturated equilibrium and initial states, which and how many gene networks, referred to as viable, share this saturated equilibrium state or the pair of saturated equilibrium and initial states. We also show that the viable networks sharing a given saturated equilibrium state must follow certain patterns. These capabilities of the analytical treatment make it possible to properly define and accurately determine robustness to noise and mutation for gene networks. Previous network research conclusions drawn from performing millions of simulations follow directly from the results of our analytical treatment. Furthermore, the analytical results provide criteria for the identification of model validity and suggest modified models of gene network dynamics. The yeast cell-cycle network is used as an illustration of the practical application of this analytical treatment. </p>","PeriodicalId":72957,"journal":{"name":"EURASIP journal on bioinformatics & systems biology","volume":"2014 1","pages":"4"},"PeriodicalIF":0.0000,"publicationDate":"2014-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/1687-4153-2014-4","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"EURASIP journal on bioinformatics & systems biology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1186/1687-4153-2014-4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

The analysis of gene network robustness to noise and mutation is important for fundamental and practical reasons. Robustness refers to the stability of the equilibrium expression state of a gene network to variations of the initial expression state and network topology. Numerical simulation of these variations is commonly used for the assessment of robustness. Since there exists a great number of possible gene network topologies and initial states, even millions of simulations may be still too small to give reliable results. When the initial and equilibrium expression states are restricted to being saturated (i.e., their elements can only take values 1 or -1 corresponding to maximum activation and maximum repression of genes), an analytical gene network robustness assessment is possible. We present this analytical treatment based on determination of the saturated fixed point attractors for sigmoidal function models. The analysis can determine (a) for a given network, which and how many saturated equilibrium states exist and which and how many saturated initial states converge to each of these saturated equilibrium states and (b) for a given saturated equilibrium state or a given pair of saturated equilibrium and initial states, which and how many gene networks, referred to as viable, share this saturated equilibrium state or the pair of saturated equilibrium and initial states. We also show that the viable networks sharing a given saturated equilibrium state must follow certain patterns. These capabilities of the analytical treatment make it possible to properly define and accurately determine robustness to noise and mutation for gene networks. Previous network research conclusions drawn from performing millions of simulations follow directly from the results of our analytical treatment. Furthermore, the analytical results provide criteria for the identification of model validity and suggest modified models of gene network dynamics. The yeast cell-cycle network is used as an illustration of the practical application of this analytical treatment.

Abstract Image

Abstract Image

Abstract Image

基于饱和不动点吸引子的基因网络鲁棒性分析。
基因网络对噪声和突变的鲁棒性分析具有重要的基础和现实意义。鲁棒性是指基因网络的平衡表达状态对初始表达状态和网络拓扑结构变化的稳定性。这些变化的数值模拟通常用于鲁棒性评估。由于存在大量可能的基因网络拓扑结构和初始状态,即使进行数百万次模拟也可能太小,无法给出可靠的结果。当初始和平衡表达状态被限制为饱和时(即它们的元素只能取1或-1,对应于基因的最大激活和最大抑制),分析基因网络稳健性评估是可能的。我们基于s型函数模型饱和不动点吸引子的确定给出了这种解析处理。分析可以确定(a)对于给定的网络,存在哪些饱和平衡状态以及存在多少饱和平衡状态以及存在哪些饱和初始状态以及有多少饱和初始状态收敛于这些饱和平衡状态中的每一个;(b)对于给定的饱和平衡状态或给定的一对饱和平衡状态和初始状态,哪些和多少基因网络,被称为可行的,共享这个饱和平衡状态或一对饱和平衡状态和初始状态。我们还证明了共享给定饱和平衡状态的可行网络必须遵循某些模式。分析处理的这些能力使得正确定义和准确确定基因网络对噪声和突变的稳健性成为可能。先前的网络研究结论是从执行数百万次模拟得出的,直接遵循我们分析处理的结果。此外,分析结果为模型有效性的识别提供了标准,并提出了基因网络动力学的修正模型。酵母细胞周期网络被用作这种分析处理的实际应用的例证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信