An Improved Expectation-Maximization Bayesian Algorithm for GWAS

被引:0
|
作者
Zhang, Ganwen [1 ]
Zhao, Jianini [1 ]
Wang, Jieru [1 ]
Lin, Guo [1 ]
Li, Lin [1 ]
Ban, Fengfei [1 ]
Zhu, Meiting [1 ]
Wen, Yangjun [1 ]
Zhang, Jin [1 ]
机构
[1] Nanjing Agr Univ, Coll Sci, Nanjing 210095, Peoples R China
关键词
GAWS; Bayesian method; mixed linear model; candidate gene; GENOME-WIDE ASSOCIATION; QUANTITATIVE TRAIT LOCI; MODEL; POPULATION; REGRESSION; LINKAGE;
D O I
10.3390/math12131944
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Genome-wide association studies (GWASs) are flexible and comprehensive tools for identifying single nucleotide polymorphisms (SNPs) associated with complex traits or diseases. The whole-genome Bayesian models are an effective way of incorporating important prior information into modeling. Bayesian methods have been widely used in association analysis. However, Bayesian analysis is often not feasible due to the high-throughput genotype and large sample sizes involved. In this study, we propose a new Bayesian algorithm under the mixed linear model framework: the expectation and maximization BayesB Improved algorithm (emBBI). The emBBI algorithm corrects polygenic and environmental noise and reduces dimensions; then, it estimates and tests marker effects using emBayesB and the LOD test, respectively. We conducted two simulation experiments and analyzed a real dataset related to flowering time in Arabidopsis to demonstrate the validation of the new algorithm. The results show that the emBBI algorithm is more flexible and accurate in simulation studies compared to established methods, and it performs well under complex genetic backgrounds. The analysis of the Arabidopsis real dataset further illustrates the advantages of the emBBI algorithm for GWAS by detecting known genes. Furthermore, 12 candidate genes are identified in the neighborhood of the significant quantitative trait nucleotides (QTNs) of flowering-related QTNs in Arabidopsis. In addition, we also performed enrichment analysis and tissue expression analysis of candidate genes, which will help us better understand the genetic basis of flowering-related traits in Arabidopsis.
引用
收藏
页数:14
相关论文
共 50 条
  • [1] The expectation-maximization algorithm
    Moon, TK
    [J]. IEEE SIGNAL PROCESSING MAGAZINE, 1996, 13 (06) : 47 - 60
  • [2] Quantum expectation-maximization algorithm
    Miyahara, Hideyuki
    Aihara, Kazuyuki
    Lechner, Wolfgang
    [J]. PHYSICAL REVIEW A, 2020, 101 (01)
  • [3] THE NOISY EXPECTATION-MAXIMIZATION ALGORITHM
    Osoba, Osonde
    Mitaim, Sanya
    Kosko, Bart
    [J]. FLUCTUATION AND NOISE LETTERS, 2013, 12 (03):
  • [4] Bayesian Variational Inference Algorithm Based on Expectation-Maximization and Simulated Annealing
    Liu Haoran
    Zhang Liyue
    Su Zhaoyu
    Zhang Yun
    Zhang Lei
    [J]. JOURNAL OF ELECTRONICS & INFORMATION TECHNOLOGY, 2021, 43 (07) : 2046 - 2054
  • [5] The Expectation-Maximization approach for Bayesian quantile regression
    Zhao, Kaifeng
    Lian, Heng
    [J]. COMPUTATIONAL STATISTICS & DATA ANALYSIS, 2016, 96 : 1 - 11
  • [6] Expectation-Maximization Algorithm with Local Adaptivity
    Leung, Shingyu
    Liang, Gang
    Solna, Knut
    Zhao, Hongkai
    [J]. SIAM JOURNAL ON IMAGING SCIENCES, 2009, 2 (03): : 834 - 857
  • [7] Improved estimators for fractional Brownian motion via the expectation-maximization algorithm
    Fischer, R
    Akay, M
    [J]. MEDICAL ENGINEERING & PHYSICS, 2002, 24 (01) : 77 - 83
  • [8] The Expectation-Maximization Algorithm: Gaussian Case The EM Algorithm
    Iatan, Iuliana F.
    [J]. 2010 INTERNATIONAL CONFERENCE ON NETWORKING AND INFORMATION TECHNOLOGY (ICNIT 2010), 2010, : 590 - 593
  • [9] ON THE BEHAVIOR OF THE EXPECTATION-MAXIMIZATION ALGORITHM FOR MIXTURE MODELS
    Barazandeh, Babak
    Razaviyayn, Meisam
    [J]. 2018 IEEE GLOBAL CONFERENCE ON SIGNAL AND INFORMATION PROCESSING (GLOBALSIP 2018), 2018, : 61 - 65
  • [10] An expectation-maximization algorithm working on data summary
    Jin, HD
    Leung, KS
    Wong, ML
    [J]. COMPUTATIONAL INTELLIGENCE AND APPLICATIONS, 2002, : 221 - 226