FastLSU: a more practical approach for the Benjamini–Hochberg FDR controlling procedure for huge-scale testing problems

    loading  Checking for direct PDF access through Ovid

Abstract

Motivation: We address a common problem in large-scale data analysis, and especially the field of genetics, the huge-scale testing problem, where millions to billions of hypotheses are tested together creating a computational challenge to control the inflation of the false discovery rate. As a solution we propose an alternative algorithm for the famous Linear Step Up procedure of Benjamini and Hochberg.

Results: Our algorithm requires linear time and does not require any P-value ordering. It permits separating huge-scale testing problems arbitrarily into computationally feasible sets or chunks. Results from the chunks are combined by our algorithm to produce the same results as the controlling procedure on the entire set of tests, thus controlling the global false discovery rate even when P-values are arbitrarily divided. The practical memory usage may also be determined arbitrarily by the size of available memory.

Availability and implementation: R code is provided in the supplementary material.

Contact:sbatista@cs.princeton.edu

Supplementary information: Supplementary data are available at Bioinformatics online.

Related Topics

    loading  Loading Related Articles