Journal
BIOINFORMATICS
Volume 38, Issue 8, Pages 2356-2357Publisher
OXFORD UNIV PRESS
DOI: 10.1093/bioinformatics/btac076
Keywords
-
Categories
Funding
- National Institutes of Health [U24CA224260, U54HL127624, R01DK131525, OT2OD030160]
Ask authors/readers for more resources
This paper introduces an algorithm called blitzGSEA, which significantly improves gene set enrichment analysis. Compared to previous methods, blitzGSEA allows for faster calculations and more accurate estimation of small P-values.
Motivation The identification of pathways and biological processes from differential gene expression is central for interpretation of data collected by transcriptomics assays. Gene set enrichment analysis (GSEA) is the most commonly used algorithm to calculate the significance of the relevancy of an annotated gene set with a differential expression signature. To compute significance, GSEA implements permutation tests which are slow and inaccurate for comparing many differential expression signatures to thousands of annotated gene sets. Results Here, we present blitzGSEA, an algorithm that is based on the same running sum statistic as GSEA, but instead of performing permutations, blitzGSEA approximates the enrichment score probabilities based on Gamma distributions. blitzGSEA achieves significant improvement in performance compared with prior GSEA implementations, while approximating small P-values more accurately.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available