• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

双向基因关系受限条件下布尔网络的推断

Inference of Boolean networks under constraint on bidirectional gene relationships.

作者信息

Vahedi G, Ivanov I V, Dougherty E R

机构信息

Department of Electrical and Computer Engineering, Texas A&M University, College Station, TX 77843, USA.

出版信息

IET Syst Biol. 2009 May;3(3):191-202. doi: 10.1049/iet-syb.2007.0070.

DOI:10.1049/iet-syb.2007.0070
PMID:19449979
Abstract

The coefficient of determination (CoD) has been used to infer Boolean networks (BNs) from steady-state data, in particular, to estimate the constituent BNs for a probabilistic BN. The advantage of the CoD method over design methods that emphasise graph topology or attractor structure is that the CoD produces a network based on strong predictive relationships between target genes and their predictor (parent) genes. The disadvantage is that spurious attractor cycles appear in the inferred network, so that there is poor inference relative to the attractor structure, that is, relative to the steady-state behaviour of the network. Given steady-state data, there should not be a significant amount of steady-state probability mass in the inferred network lying outside the mass of the data distribution; however, the existence of spurious attractor cycles creates a significant amount of steady-state probability mass not accounted for by the data. Using steady-state data hampers design because the lack of temporal data causes CoD design to suffer from a lack of directionality with regard to prediction. This results in spurious bidirectional relationships among genes in which two genes are among the predictors for each other, when actually only one of them should be a predictor of the other, thereby creating a spurious attractor cycle. This paper characterises the manner in which bidirectional relationships affect the attractor structure of a BN. Given this characterisation, the authors propose a constrained CoD inference algorithm that outperforms unconstrained CoD inference in avoiding the creation of spurious non-singleton attractor. Algorithm performances are compared using a melanoma-based network.

摘要

决定系数(CoD)已被用于从稳态数据推断布尔网络(BNs),特别是用于估计概率布尔网络的组成布尔网络。与强调图拓扑或吸引子结构的设计方法相比,CoD方法的优势在于它基于目标基因与其预测(父)基因之间的强预测关系生成网络。缺点是在推断出的网络中会出现虚假吸引子循环,因此相对于吸引子结构,即相对于网络的稳态行为,推断效果较差。给定稳态数据,在推断出的网络中,不应存在位于数据分布质量之外的大量稳态概率质量;然而,虚假吸引子循环的存在会产生大量未被数据解释的稳态概率质量。使用稳态数据会妨碍设计,因为缺乏时间数据导致CoD设计在预测方面缺乏方向性。这会导致基因之间出现虚假的双向关系,即两个基因互为预测因子,而实际上应该只有其中一个是另一个的预测因子,从而产生虚假吸引子循环。本文描述了双向关系影响布尔网络吸引子结构的方式。基于这一描述,作者提出了一种受限CoD推理算法,该算法在避免创建虚假非单吸引子方面优于无约束CoD推理。使用基于黑色素瘤的网络比较了算法性能。

相似文献

1
Inference of Boolean networks under constraint on bidirectional gene relationships.双向基因关系受限条件下布尔网络的推断
IET Syst Biol. 2009 May;3(3):191-202. doi: 10.1049/iet-syb.2007.0070.
2
Generating Boolean networks with a prescribed attractor structure.生成具有规定吸引子结构的布尔网络。
Bioinformatics. 2005 Nov 1;21(21):4021-5. doi: 10.1093/bioinformatics/bti664. Epub 2005 Sep 8.
3
A CoD-based reduction algorithm for designing stationary control policies on Boolean networks.基于 CoD 的布尔网络定态控制策略设计约简算法。
Bioinformatics. 2010 Jun 15;26(12):1556-63. doi: 10.1093/bioinformatics/btq225. Epub 2010 Apr 25.
4
Inferring Boolean networks with perturbation from sparse gene expression data: a general model applied to the interferon regulatory network.从稀疏基因表达数据推断具有扰动的布尔网络:应用于干扰素调节网络的通用模型
Mol Biosyst. 2008 Oct;4(10):1024-30. doi: 10.1039/b804649b. Epub 2008 Aug 26.
5
Generating probabilistic Boolean networks from a prescribed transition probability matrix.从给定的转移概率矩阵生成概率布尔网络。
IET Syst Biol. 2009 Nov;3(6):453-64. doi: 10.1049/iet-syb.2008.0173.
6
Intervention in a family of Boolean networks.布尔网络家族中的干预。
Bioinformatics. 2006 Jan 15;22(2):226-32. doi: 10.1093/bioinformatics/bti765. Epub 2005 Nov 12.
7
Maximum number of fixed points in regulatory Boolean networks.调控布尔网络中不动点的最大数量。
Bull Math Biol. 2008 Jul;70(5):1398-409. doi: 10.1007/s11538-008-9304-7. Epub 2008 Feb 29.
8
Robustness and state-space structure of Boolean gene regulatory models.布尔基因调控模型的稳健性与状态空间结构
J Theor Biol. 2007 Dec 21;249(4):749-65. doi: 10.1016/j.jtbi.2007.09.004. Epub 2007 Sep 12.
9
New probabilistic graphical models for genetic regulatory networks studies.用于基因调控网络研究的新型概率图形模型。
J Biomed Inform. 2005 Dec;38(6):443-55. doi: 10.1016/j.jbi.2005.04.003. Epub 2005 Jun 9.
10
Intrinsic properties of Boolean dynamics in complex networks.复杂网络中布尔动力学的内在性质。
J Theor Biol. 2009 Feb 7;256(3):351-69. doi: 10.1016/j.jtbi.2008.10.014. Epub 2008 Oct 29.

引用本文的文献

1
Recent development and biomedical applications of probabilistic Boolean networks.概率布尔网络的最新发展及其在生物医学中的应用。
Cell Commun Signal. 2013 Jul 1;11:46. doi: 10.1186/1478-811X-11-46.
2
Constraint-based analysis of gene interactions using restricted boolean networks and time-series data.使用受限布尔网络和时间序列数据对基因相互作用进行基于约束的分析。
BMC Proc. 2011 May 28;5 Suppl 2(Suppl 2):S5. doi: 10.1186/1753-6561-5-S2-S5.
3
Boolean models of genomic regulatory networks: reduction mappings, inference, and external control.
基因组调控网络的布尔模型:约简映射、推理和外部控制。
Curr Genomics. 2009 Sep;10(6):375-87. doi: 10.2174/138920209789177584.