EpiMCBN: A Kind of Epistasis Mining Approach Using MCMC Sampling Optimizing Bayesian Network

Xuan Yang, Keqin Li, Yang Zhang, Xi Yu, Junli Deng, Jianxiao Liu
{"title":"EpiMCBN: A Kind of Epistasis Mining Approach Using MCMC Sampling Optimizing Bayesian Network","authors":"Xuan Yang, Keqin Li, Yang Zhang, Xi Yu, Junli Deng, Jianxiao Liu","doi":"10.1109/BIBM55620.2022.9995264","DOIUrl":null,"url":null,"abstract":"Proposing a more effective and accurate epistatic loci detection method is of great significance in improving crop quality, disease treatment, etc. Due to the characteristics of high accuracy and processing non-linear relationship, Bayesian network (BN) has been widely used in constructing the network of SNPs and phenotypes and thus to mine epistasis. However, the shortcoming of BN is that the search space is too large and unable to process large-scale SNPs. In this work, we propose a kind of epistasis mining method using Markov Chain Monte Carlo (MCMC) sampling optimizing Bayesian network (EpiMCBN). Firstly, we use the space of node order composed of SNPs and phenotype to replace the space of network structure. Then MCMC algorithm is used to do sampling to generate multiple different initial orders in linear space or partial space. We use Markov state transition matrix to transfer the initial samples along the Markov chain, thus obtaining multiple order samples. Then we use the $\\alpha$-BICBN scoring function to score the Bayesian networks corresponding to these node orders. Through estimating the probability of edge occurrence in the Bayesian networks, we get an approximate Bayesian network of SNPs and phenotype, then obtain the epistatic loci affecting phenotype. Finally, we compare EpiMCBN with the current popular epistasis mining algorithms using both simulated and real age-related macular disease (AMD) datasets. Experiment results show that EpiMCBN has better epistasis detection accuracy, lower false positive rate, and higher F1-score compared to other methods. Availability and implementation: Source code and dataset are available at: http://122.205.95.139/EpiMCBN/.","PeriodicalId":210337,"journal":{"name":"2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BIBM55620.2022.9995264","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Proposing a more effective and accurate epistatic loci detection method is of great significance in improving crop quality, disease treatment, etc. Due to the characteristics of high accuracy and processing non-linear relationship, Bayesian network (BN) has been widely used in constructing the network of SNPs and phenotypes and thus to mine epistasis. However, the shortcoming of BN is that the search space is too large and unable to process large-scale SNPs. In this work, we propose a kind of epistasis mining method using Markov Chain Monte Carlo (MCMC) sampling optimizing Bayesian network (EpiMCBN). Firstly, we use the space of node order composed of SNPs and phenotype to replace the space of network structure. Then MCMC algorithm is used to do sampling to generate multiple different initial orders in linear space or partial space. We use Markov state transition matrix to transfer the initial samples along the Markov chain, thus obtaining multiple order samples. Then we use the $\alpha$-BICBN scoring function to score the Bayesian networks corresponding to these node orders. Through estimating the probability of edge occurrence in the Bayesian networks, we get an approximate Bayesian network of SNPs and phenotype, then obtain the epistatic loci affecting phenotype. Finally, we compare EpiMCBN with the current popular epistasis mining algorithms using both simulated and real age-related macular disease (AMD) datasets. Experiment results show that EpiMCBN has better epistasis detection accuracy, lower false positive rate, and higher F1-score compared to other methods. Availability and implementation: Source code and dataset are available at: http://122.205.95.139/EpiMCBN/.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
EpiMCBN:一种基于MCMC采样优化贝叶斯网络的上位挖掘方法
提出一种更有效、准确的上位性位点检测方法对提高作物品质、病害防治等具有重要意义。贝叶斯网络(Bayesian network, BN)由于具有精度高、处理非线性关系的特点,被广泛应用于构建snp与表型网络,进而挖掘上位性。然而,BN的缺点是搜索空间太大,无法处理大规模的snp。本文提出了一种基于马尔可夫链蒙特卡罗(MCMC)采样优化贝叶斯网络(EpiMCBN)的上位性挖掘方法。首先,我们使用由snp和表型组成的节点顺序空间来代替网络结构空间。然后利用MCMC算法进行采样,在线性空间或部分空间中生成多个不同的初始阶数。我们利用马尔可夫状态转移矩阵沿马尔可夫链传递初始样本,从而获得多阶样本。然后使用$\alpha$-BICBN评分函数对这些节点顺序对应的贝叶斯网络进行评分。通过估计贝叶斯网络中边缘出现的概率,得到snp与表型的近似贝叶斯网络,进而得到影响表型的上位基因座。最后,我们使用模拟和真实年龄相关性黄斑疾病(AMD)数据集将EpiMCBN与当前流行的上位性挖掘算法进行比较。实验结果表明,与其他方法相比,EpiMCBN具有更好的上位性检测准确率、更低的假阳性率和更高的f1评分。可用性和实现:源代码和数据集可在:http://122.205.95.139/EpiMCBN/。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A framework for associating structural variants with cell-specific transcription factors and histone modifications in defect phenotypes Secure Password Using EEG-based BrainPrint System: Unlock Smartphone Password Using Brain-Computer Interface Technology On functional annotation with gene co-expression networks ST-ChIP: Accurate prediction of spatiotemporal ChIP-seq data with recurrent neural networks Discovering the Knowledge in Unstructured Early Drug Development Data Using NLP and Advanced Analytics
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1