Inference of Gene Regulatory Network Based on Local Bayesian Networks
2016-08
发表期刊PLOS COMPUTATIONAL BIOLOGY (IF:3.8[JCR-2023],4.3[5-Year])
ISSN1553-734X
卷号12期号:8
发表状态已发表
DOI10.1371/journal.pcbi.1005024
摘要The inference of gene regulatory networks (GRNs) from expression data can mine the direct regulations among genes and gain deep insights into biological processes at a network level. During past decades, numerous computational approaches have been introduced for inferring the GRNs. However, many of them still suffer from various problems, e.g., Bayesian network (BN) methods cannot handle large-scale networks due to their high computational complexity, while information theory-based methods cannot identify the directions of regulatory interactions and also suffer from false positive/negative problems. To overcome the limitations, in this work we present a novel algorithm, namely local Bayesian network (LBN), to infer GRNs from gene expression data by using the network decomposition strategy and false-positive edge elimination scheme. Specifically, LBN algorithm first uses conditional mutual information (CMI) to construct an initial network or GRN, which is decomposed into a number of local networks or GRNs. Then, BN method is employed to generate a series of local BNs by selecting the k-nearest neighbors of each gene as its candidate regulatory genes, which significantly reduces the exponential search space from all possible GRN structures. Integrating these local BNs forms a tentative network or GRN by performing CMI, which reduces redundant regulations in the GRN and thus alleviates the false positive problem. The final network or GRN can be obtained by iteratively performing CMI and local BN on the tentative network. In the iterative process, the false or redundant regulations are gradually removed. When tested on the benchmark GRN datasets from DREAM challenge as well as the SOS DNA repair network in E. coli, our results suggest that LBN outperforms other state-of-the-art methods (ARACNE, GENIE3 and NARROMI) significantly, with more accurate and robust performance. In particular, the decomposition strategy with local Bayesian networks not only effectively reduce the computational cost of BN due to much smaller sizes of local GRNs, but also identify the directions of the regulations.
收录类别SCI ; EI
语种英语
资助项目JSPS KAKENHI[15H05707]
WOS研究方向Biochemistry & Molecular Biology ; Mathematical & Computational Biology
WOS类目Biochemical Research Methods ; Mathematical & Computational Biology
WOS记录号WOS:000383346100008
出版者PUBLIC LIBRARY SCIENCE
WOS关键词CONDITIONAL MUTUAL INFORMATION ; EXPRESSION DATA ; TRANSCRIPTIONAL REGULATION ; ESCHERICHIA-COLI ; ALGORITHM ; RECONSTRUCTION ; MODEL
原始文献类型Article
引用统计
正在获取...
文献类型期刊论文
条目标识符https://kms.shanghaitech.edu.cn/handle/2MSLDSTB/1769
专题生命科学与技术学院_特聘教授组_陈洛南组
通讯作者Zhang, Shao-Wu
作者单位
1.Northwestern Polytech Univ, Minist Educ, Sch Automat, Key Lab Informat Fusion Technol, Xian, Peoples R China
2.Baoji Univ Arts & Sci, Inst Phys & Optoelect Technol, Baoji, Peoples R China
3.Chinese Acad Sci, Shanghai Inst Biol Sci, Inst Biochem & Cell Biol, Key Lab Syst Biol,Innovat Ctr Cell Signaling Netw, Shanghai, Peoples R China
4.ShanghaiTech Univ, Sch Life Sci & Technol, Shanghai, Peoples R China
推荐引用方式
GB/T 7714
Liu, Fei,Zhang, Shao-Wu,Guo, Wei-Feng,et al. Inference of Gene Regulatory Network Based on Local Bayesian Networks[J]. PLOS COMPUTATIONAL BIOLOGY,2016,12(8).
APA Liu, Fei,Zhang, Shao-Wu,Guo, Wei-Feng,Wei, Ze-Gang,&Chen, Luonan.(2016).Inference of Gene Regulatory Network Based on Local Bayesian Networks.PLOS COMPUTATIONAL BIOLOGY,12(8).
MLA Liu, Fei,et al."Inference of Gene Regulatory Network Based on Local Bayesian Networks".PLOS COMPUTATIONAL BIOLOGY 12.8(2016).
条目包含的文件
文件名称/大小 文献类型 版本类型 开放类型 使用许可
个性服务
查看访问统计
谷歌学术
谷歌学术中相似的文章
[Liu, Fei]的文章
[Zhang, Shao-Wu]的文章
[Guo, Wei-Feng]的文章
百度学术
百度学术中相似的文章
[Liu, Fei]的文章
[Zhang, Shao-Wu]的文章
[Guo, Wei-Feng]的文章
必应学术
必应学术中相似的文章
[Liu, Fei]的文章
[Zhang, Shao-Wu]的文章
[Guo, Wei-Feng]的文章
相关权益政策
暂无数据
收藏/分享
文件名: 1769.pdf
格式: Adobe PDF
此文件暂不支持浏览
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。