Efficient p-value estimation in massively parallel testing problems
From MaRDI portal
Recommendations
- Efficient \(p\)-value evaluation for resampling-based tests
- On the expected runtime of multiple testing algorithms with bounded error
- On the asymptotic efficiency of tests in hypothesis testing problems
- scientific article; zbMATH DE number 176080
- A distributed multiple sample testing for massive data
- scientific article; zbMATH DE number 3915459
- Fully Distributed Sequential Hypothesis Testing: Algorithms and Asymptotic Analyses
- Efficient tests under a weak convergence assumption
- On the Optimality of Binning for Distributed Hypothesis Testing
Cites work
Cited in
(8)- Fast approximation of small p-values in permutation tests by partitioning the permutations
- A geometric interpretation of the permutation \(p\)-value and its application in eQTL studies
- Marginal screening of \(2 \times 2\) tables in large-scale case-control studies
- A new method for detecting significant p-values with applications to genetic data
- Efficient evaluation of ranking procedures when the number of units is large, with application to SNP identification
- On efficiency of estimation and testing with data quantized to fixed number of cells
- Permutation p-value approximation via generalized Stolarsky invariance
- Efficient \(p\)-value evaluation for resampling-based tests
This page was built for publication: Efficient p-value estimation in massively parallel testing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3304934)
