curveMaxFP_alternatives: Upper bound for the number of false discoveries among most...

curveMaxFP_BNR2014R Documentation

Upper bound for the number of false discoveries among most significant items

Description

Upper bound for the number of false discoveries among most significant items

Usage

curveMaxFP_BNR2014(p.values, thr)

curveMaxFP_Mein2006(p.values, thr)

Arguments

p.values

A vector containing all m p-values, sorted non-decreasingly

thr

A vector of K JER-controlling thresholds, sorted non-decreasingly

Details

These older implementations of 'curveMaxFP' are here for the purpose of testing that the current one yields consistent results.

Value

A vector of size m giving an joint upper confidence bound on the number of false discoveries among the k most significant items for all k \in \{1\ldots m\}.

Author(s)

Gilles Blanchard, Nicolas Enjalbert-Courrech, Pierre Neuvial and Etienne Roquain


pneuvial/sanssouci documentation built on June 29, 2024, 9:49 a.m.