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 条
  • [41] Likelihood Ratio Tests for a Large Directed Acyclic Graph
    Li, Chunlin
    Shen, Xiaotong
    Pan, Wei
    JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 2020, 115 (531) : 1304 - 1319
  • [42] Compatible prior distributions for directed acyclic graph models
    Roverato, A
    Consonni, G
    JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-STATISTICAL METHODOLOGY, 2004, 66 : 47 - 61
  • [43] Directed Acyclic Graph as Tangle: an IoT Alternative to Blockchains
    Zivic, N.
    Kadusic, E.
    Kadusic, K.
    2019 27TH TELECOMMUNICATIONS FORUM (TELFOR 2019), 2019, : 675 - 677
  • [44] Directed Acyclic Graph Network for Conversational Emotion Recognition
    Shen, Weizhou
    Wu, Siyue
    Yang, Yunyi
    Quan, Xiaojun
    59TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS AND THE 11TH INTERNATIONAL JOINT CONFERENCE ON NATURAL LANGUAGE PROCESSING, VOL 1 (ACL-IJCNLP 2021), 2021, : 1551 - 1560
  • [45] A rough set framework for learning in a directed acyclic graph
    Midelfart, H
    Komorowski, J
    ROUGH SETS AND CURRENT TRENDS IN COMPUTING, PROCEEDINGS, 2002, 2475 : 144 - 155
  • [46] Directed acyclic graph kernels for structural RNA analysis
    Kengo Sato
    Toutai Mituyama
    Kiyoshi Asai
    Yasubumi Sakakibara
    BMC Bioinformatics, 9
  • [47] Directed Acyclic Graph Learning on Attributed Heterogeneous Network
    Liang, Jiaxuan
    Wang, Jun
    Yu, Guoxian
    Guo, Wei
    Domeniconi, Carlotta
    Guo, Maozu
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2023, 35 (10) : 10845 - 10856
  • [48] Directed acyclic graph kernels for structural RNA analysis
    Sato, Kengo
    Mituyama, Toutai
    Asai, Kiyoshi
    Sakakibara, Yasubumi
    BMC BIOINFORMATICS, 2008, 9 (1)
  • [49] Directed Acyclic Graph Extraction from Event Logs
    Vasilecas, Olegas
    Savickas, Titas
    Lebedys, Evaldas
    INFORMATION AND SOFTWARE TECHNOLOGIES, ICIST 2014, 2014, 465 : 172 - 181
  • [50] A phase transition phenomenon in a random directed acyclic graph
    Pittel, B
    Tungol, R
    RANDOM STRUCTURES & ALGORITHMS, 2001, 18 (02) : 164 - 184