Moment based gene set tests
Jessica L. Larson, Art B. Owen

TL;DR
This paper introduces a moment-based parametric approximation method for gene set tests that significantly reduces computational costs while maintaining accuracy, enabling efficient analysis of high-throughput gene expression data.
Contribution
It develops a novel moment-based approach to approximate permutation p-values for gene set tests, improving efficiency over traditional permutation methods.
Findings
Accurately approximates permutation p-values using moments.
Achieves substantial computational speedup, especially for quadratic statistics.
Identifies new enriched gene sets in Parkinson's Disease datasets.
Abstract
{\bf Motivation:} Permutation-based gene set tests are standard approaches for testing relationshi ps between collections of related genes and an outcome of interest in high throughput expression analyses. Using random permutations, one can attain -values as small as . When many gene sets are tested, we need smaller -values, hence larger , to achieve significance while accounting for the n umber of simultaneous tests being made. As a result, the number of permutations to be done rises along with the cost per permutation. To reduce this cost, we seek parametric approximations to the permutation distributions for gene set tes ts. {\bf Results:} We focus on two gene set methods related to sums and sums of squared statistics. Our approach calculates exact relevant moments of a weighted sum of (squared) test statistics under permutation. We find moment-based gene…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGene expression and cancer classification · Genomics and Chromatin Dynamics · Bioinformatics and Genomic Networks
