Detecting epistasis via Markov bases

被引:0
|
作者
Malaspinas, Anna-Sapfo [1 ]
Uhler, Caroline [2 ]
机构
[1] Univ Calif Berkeley, Dept Integrat Biol, Berkeley, CA 94720 USA
[2] Univ Calif Berkeley, Dept Stat, Berkeley, CA 94720 USA
关键词
Epistasis; Markov basis; association studies; sparse contingency tables; Fisher's exact test;
D O I
暂无
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
Rapid research progress in genotyping techniques have allowed large genome-wide association studies. Existing methods often focus on determining associations between single loci and a specific phenotype. However, a particular phenotype is usually the result of complex relationships between multiple loci and the environment. In this paper, we describe a two-stage method for detecting epistasis by combining the traditionally used single-locus search with a search for multiway interactions. Our method is based on an extended version of Fisher's exact test. To perform this test, a Markov chain is constructed on the space of multidimensional contingency tables using the elements of a Markov basis as moves. We test our method on simulated data and compare it to a two-stage logistic regression method and to a fully Bayesian method, showing that we are able to detect the interacting loci when other methods fail to do so. Finally, we apply our method to a genome-wide data set consisting of 685 dogs and identify epistasis associated with canine hair length for four pairs of single nucleotide polymorphisms (SNPs).
引用
收藏
页码:36 / 53
页数:18
相关论文
共 50 条
  • [31] Detecting the genomic signal of polygenic adaptation and the role of epistasis in evolution
    Csillery, Katalin
    Rodriguez-Verdugo, Alejandra
    Rellstab, Christian
    Guillaume, Frederic
    MOLECULAR ECOLOGY, 2018, 27 (03) : 606 - 612
  • [32] Bayesian neural networks for detecting epistasis in genetic association studies
    Beam, Andrew L.
    Motsinger-Reif, Alison
    Doyle, Jon
    BMC BIOINFORMATICS, 2014, 15
  • [33] New epistasis measures for detecting independently optimizable partitions of variables
    Seo, DI
    Choi, SS
    Moon, BR
    GENETIC AND EVOLUTIONARY COMPUTATION GECCO 2004 , PT 2, PROCEEDINGS, 2004, 3103 : 150 - 161
  • [34] Markov Bases: A 25 Year Update
    Almendra-Hernandez, Felix
    De Loera, Jesus A.
    Petrovic, Sonja
    JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 2024, 119 (546) : 1671 - 1686
  • [35] Markov bases for decomposable graphical models
    Dobra, A
    BERNOULLI, 2003, 9 (06) : 1093 - 1108
  • [36] Markov Bases and Generalized Lawrence Liftings
    Charalambous, Hara
    Thoma, Apostolos
    Vladoiu, Marius
    ANNALS OF COMBINATORICS, 2015, 19 (04) : 661 - 669
  • [37] Markov Bases of Binary Graph Models
    Mike Develin
    Seth Sullivant
    Annals of Combinatorics, 2003, 7 (4) : 441 - 466
  • [38] Markov Bases and Generalized Lawrence Liftings
    Hara Charalambous
    Apostolos Thoma
    Marius Vladoiu
    Annals of Combinatorics, 2015, 19 : 661 - 669
  • [39] SMMB: a stochastic Markov blanket framework strategy for epistasis detection in GWAS
    Niel, Clement
    Sinoquet, Christine
    Dina, Christian
    Rocheleau, Ghislain
    BIOINFORMATICS, 2018, 34 (16) : 2773 - 2780
  • [40] EXPLAINING VARIATION IN SCHIZOPHRENIA ENDOPHENOTYPES VIA EPISTASIS
    Nicodemus, Kristin
    SCHIZOPHRENIA BULLETIN, 2015, 41 : S209 - S209