A shortcut for multiple testing on the directed acyclic graph of gene ontology

被引:5
|
作者
Saunders, Garrett [1 ,3 ]
Stevens, John R. [1 ]
Isom, S. Clay [2 ]
机构
[1] Utah State Univ, Dept Math & Stat, Logan, UT 84322 USA
[2] Utah State Univ, Dept Anim Dairy & Vet Sci, Logan, UT 84322 USA
[3] Brigham Young Univ, Dept Math, Rexburg, ID USA
来源
BMC BIOINFORMATICS | 2014年 / 15卷
关键词
Bonferroni; Holm; Gene ontology; Multiple testing; EXPRESSION DATA; RNA-SEQ; MICROARRAY; SETS; TOOL;
D O I
10.1186/s12859-014-0349-3
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Background: Gene set testing has become an important analysis technique in high throughput microarray and next generation sequencing studies for uncovering patterns of differential expression of various biological processes. Often, the large number of gene sets that are tested simultaneously require some sort of multiplicity correction to account for the multiplicity effect. This work provides a substantial computational improvement to an existing familywise error rate controlling multiplicity approach (the Focus Level method) for gene set testing in high throughput microarray and next generation sequencing studies using Gene Ontology graphs, which we call the Short Focus Level. Results: The Short Focus Level procedure, which performs a shortcut of the full Focus Level procedure, is achieved by extending the reach of graphical weighted Bonferroni testing to closed testing situations where restricted hypotheses are present, such as in the Gene Ontology graphs. The Short Focus Level multiplicity adjustment can perform the full top-down approach of the original Focus Level procedure, overcoming a significant disadvantage of the otherwise powerful Focus Level multiplicity adjustment. The computational and power differences of the Short Focus Level procedure as compared to the original Focus Level procedure are demonstrated both through simulation and using real data. Conclusions: The Short Focus Level procedure shows a significant increase in computation speed over the original Focus Level procedure (as much as similar to 15,000 times faster). The Short Focus Level should be used in place of the Focus Level procedure whenever the logical assumptions of the Gene Ontology graph structure are appropriate for the study objectives and when either no a priori focus level of interest can be specified or the focus level is selected at a higher level of the graph, where the Focus Level procedure is computationally intractable.
引用
收藏
页数:16
相关论文
共 50 条
  • [31] Approximating the directed minimum degree spanning tree of directed acyclic graph
    Yao, Guohui
    Zhu, Daming
    Ma, Shaohan
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2009, 46 (06): : 1052 - 1057
  • [32] Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts
    Takagi, Takuya
    Inenaga, Shunsuke
    Arimura, Hiroki
    Breslauer, Dany
    Hendrian, Diptarama
    ALGORITHMICA, 2020, 82 (05) : 1346 - 1377
  • [33] Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts
    Takuya Takagi
    Shunsuke Inenaga
    Hiroki Arimura
    Dany Breslauer
    Diptarama Hendrian
    Algorithmica, 2020, 82 : 1346 - 1377
  • [34] Inference for a Large Directed Acyclic Graph with Unspecified Interventions
    Li, Chunlin
    Shen, Xiaotong
    Pan, Wei
    JOURNAL OF MACHINE LEARNING RESEARCH, 2023, 24
  • [35] SIMPLE ENUMERATION OF MINIMAL CUTSETS OF ACYCLIC DIRECTED GRAPH
    AHMAD, SH
    IEEE TRANSACTIONS ON RELIABILITY, 1988, 37 (05) : 484 - 487
  • [36] Constrained likelihood for reconstructing a directed acyclic Gaussian graph
    Yuan, Yiping
    Shen, Xiaotong
    Pan, Wei
    Wang, Zizhuo
    BIOMETRIKA, 2019, 106 (01) : 109 - 125
  • [37] A directed acyclic graph representation of routing manufacturing flexibility
    Borenstein, D
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 127 (01) : 78 - 93
  • [38] A Parallel Programming Pattern based on Directed Acyclic Graph
    Meng, Zheng
    Lin, Ying
    Kang, Yan
    Yu, Qian
    SENSORS, MEASUREMENT AND INTELLIGENT MATERIALS, PTS 1-4, 2013, 303-306 : 2165 - 2169
  • [39] Decentralized Directed acyclic graph based DLT Network
    Saad, A.
    Park, Soo Young
    INTERNATIONAL CONFERENCE ON OMNI-LAYER INTELLIGENT SYSTEMS (COINS), 2019, : 158 - 163
  • [40] FINDING A HOMOTOPY BASE FOR DIRECTED PATHS IN AN ACYCLIC GRAPH
    MUROTA, K
    FUJISHIGE, S
    DISCRETE APPLIED MATHEMATICS, 1987, 17 (1-2) : 157 - 162