<title>Background</title> <p>The false discovery rate (FDR) plays a prominent role in many high-dimensional testing and model selection procedures. Consequently, FDR methodologies are ubiquitous in the analysis of high-throughput data, such as in differential gene expression, SNP biomarker selection, peak detection in proteomic mass spectrometry data, or inference of edges in a network.</p> <p>False discovery rate analysis starts with the seminal works by Schweder and Spjøtvoll [##UREF##0##1##] and by Benjamini and Hochberg [##UREF##1##2##]. Many others have followed suite, so that to date an impressive number of different algorithms for controlling and estimating false discovery rates have appeared in the literature.</p> <p>In a nutshell, FDR estimation algorithms may be broadly categorized by the type of</p> <p>• FDR,</p> <p>• input test statistic, and</p> <p>• employed inference procedures.</p> <p>There are two main types of FDR, the "classic" tail area-based FDR (= Fdr) and local FDR (= fdr). Most FDR procedures are concerned either with Fdr or fdr, simultaneous estimation of both types of FDR is only possible with a few selected algorithms. With regard to test statistics, FDR calculations typically rely on <italic>p</italic>-values. However, FDR can be easily extended to other test statistics, such as correlations [##REF##15479708##3##]. Relaxing the requirement of having <italic>p</italic>-values as input has the additional benefit that it allows for empirical null modeling [##UREF##2##4##]. Further key differences among the various FDR methods relate primarily to their respective procedures for density estimation and for inferring the proportion of null statistics.</p> <p>Here, a unified statistical procedure for FDR estimation is described that generalizes a number of previous algorithms, specifically those of [##UREF##3##5##,##REF##16086831##6##,##UREF##2##4##] and [##REF##12883005##7##]. Notable features of thus approach include simultaneous estimation of Fdr and fdr from a diverse range of test statistics, its simplicity, very little a prior modeling assumptions, and the option of fitting the empirical null model.</p> <p>The remainder of this paper is set out as follows. In the first part of the 'Methods' section a brief overview is given of the basic theory and definitions related to FDR and its estimation. In the second part of the 'Methods' section the proposed unified FDR procedure is described in detail. In the remaining part of the paper the new procedure is evaluated in comparison with other competing FDR estimation schemes.</p>
<title>Methods</title> <title>Basic theory of FDR</title> <p>This section gives a very brief review of the two component FDR model and the local and tail area-based FDR criteria. For a more refined discussion it is referred to [##UREF##4##8##] and references therein.</p> <p>Throughout the paper the Efron naming conventions are followed. Specifically, "fdr" denotes the local false discovery rate, "Fdr" denotes the tail area-based false discovery rate, and "FDR" is a generic term encompassing both variants. Similarly, FNDR is the generic abbreviation for the false non-discovery rate [##UREF##5##9##].</p> <p>In the following <italic>m </italic>simultaneous tests are considered, resulting in <italic>m </italic>test statistics such as <italic>t</italic><sub>1</sub>,...,<italic>t</italic><sub><italic>m </italic></sub>or <italic>z</italic><sub>1</sub>,...,<italic>z</italic><sub><italic>m </italic></sub>and corresponding <italic>p</italic>-values <italic>p</italic><sub>1</sub>,...,<italic>p</italic><sub><italic>m</italic></sub>.</p> <title>Tail area-based FDR</title> <p>In order to control the number of false discoveries, i.e. the expected ratio <italic>E</italic>(<italic>V/R</italic>) of the number of false positives <italic>V </italic>among all significant tests <italic>R</italic>, Benjamini and Hochberg [##UREF##1##2##] introduced the following linear step-up procedure. First, the <italic>p</italic>-values are ordered so that <italic>p</italic><sub>(1) </sub>≤ ... ≤ <italic>p</italic><sub>(<italic>m</italic>)</sub>. Second, each value <italic>p</italic><sub>(<italic>i</italic>) </sub>is compared with , where <italic>q </italic>is the desired FDR level. Finally, with <italic>k </italic>= max(<italic>i </italic>: <italic>p</italic><sub>(<italic>i</italic>) </sub>≤ ) all hypotheses belonging to <italic>p</italic><sub>(1)</sub>,...,<italic>p</italic><sub>(<italic>k</italic>) </sub>are rejected. [##UREF##1##2##] show that when the test statistics are independent then this procedure controls <italic>E</italic>(<italic>V/R</italic>) at level ≤ <italic>q</italic>.</p> <p>The above procedure suggests the following simple correction of <italic>p</italic>-values, in the following called Benjamini-Hochberg (BH) rule:</p> <p></p> <p>Here order(<italic>p</italic><sub><italic>i</italic></sub>) equals one for the smallest and <italic>m </italic>for the largest <italic>p</italic>-value, respectively. For comparison, the standard Bonferroni correction [##UREF##6##10##] is , and hence .</p> <p>A way to intuitively understand BH rule is to consider the following two-component mixture of the observed <italic>p</italic>-values,</p> <p></p> <p>For <italic>p</italic>-values the null density <italic>f</italic><sub>0 </sub>is the uniform distribution U(0,1) and corresponds to the "uninteresting" <italic>p</italic>-values, whereas <italic>f</italic><sub><italic>A </italic></sub>is an unspecified alternative density for the "interesting" <italic>p</italic>-values. This mixture model may also be written in terms of distribution functions,</p> <p></p> <p>Fig. ##FIG##0##1## illustrates the <italic>p</italic>-value mixture model using the transformed statistic <italic>y </italic>= 1 - <italic>p</italic>.</p> <p>This two-component model provides the means for <italic>defining </italic>the tail area-based false discovery rate "Fdr"and also the false non-discovery rate "Fndr"[##UREF##5##9##]. Specifically, Fdr(<italic>p</italic>) = <italic>η</italic><sub>0</sub><italic>p</italic>/<italic>F</italic>(<italic>p</italic>) – see also Table ##TAB##0##1##. This "Bayesian" definition of "Fdr" [##UREF##7##11##] is closely related but not identical to the original approach by Benjamini and Hochberg. The key difference is that being density-based it implicitly assumes that the number of hypotheses is large (<italic>m </italic>→ ∞). Intriguingly, this allows to view most FDR procedures based on the observed test statistics as providing <italic>estimates </italic>of "Fdr" (note the subtle but important difference of estimating FDR versus controlling FDR).</p> <p>In case of the BH-corrected <italic>p</italic>-values (Eq. 1), it turns out that this rule is simply the nonparametric empirical estimator of Fdr:</p> <p></p> <p>Plugging in the empirical cumulative density function (ECDF)  as estimator of <italic>F</italic>(<italic>p</italic>) and using the conservative guess  = 1 yields</p> <p></p> <p>It is instructive to compare the definitions of "Fdr" and "Fndr" for a given threshold <italic>y </italic>with those of "sensitivity" and "specificity" – see Table ##TAB##0##1##. Note that the order of conditioning is reversed in the two instances, but otherwise the definitions are very similar. Furthermore, both "Fdr-Fndr" and "sensitivity-specificity" offer the means for determining an optimal decision rule. In a conventional test situation the threshold <italic>y </italic>is chosen to maximize both sensitivity and specificity (i.e. typically specificity is fixed and power is maximized). Analogously, in an FDR analysis one seeks to minimize Fdr and Fndr (e.g, by fixing Fndr and minimizing Fdr). Hence, there is a tradeoff between Fndr and Fdr, just as there is a tradeoff between sensitivity and specificity. Note that the formal similarities between Fdr/Fndr and sensitivity/specificity is yet another reason for prefering the Bayesian variant of FDR over other more operational definitions.</p> <p>The BH rule is popular due to its simplicity. However, often it is a rather conservative estimator of Fdr. One way to improve the BH rule is to substitute a more appropriate estimate of the null proportion <italic>η</italic><sub>0</sub>. This leads directly to the well-known <italic>q</italic>-values, which are refined BH estimates with various suggested options for the estimation of <italic>η</italic><sub>0 </sub>[##UREF##8##12##,##REF##12883005##7##].</p> <p>Additionally, monotonicity is another issue where the BH rule is open to improvement. Specifically, direct application of the BH correction easily yields corrected <italic>p</italic>-values with a different ordering than that of the original test statistics. This unpleasant property has already been noted by [##UREF##1##2##], and indeed the "max" function in the original step-up procedure provides a corresponding fix (albeit a rather adhoc one). [##UREF##3##5##,##REF##16086831##6##] point out that this issue can be more elegantly resolved by requiring the distribution function <italic>F</italic>(<italic>p</italic>) of the <italic>p</italic>-values to be concave and, correspondingly, the marginal density <italic>f</italic>(<italic>p</italic>) to be monotonically decreasing. There many different ways for fitting the two component FDR mixture model (Eqs. 2 and 3) and for estimating densities and <italic>η</italic><sub>0</sub>. This explains the multitude of FDR approaches in existence. Common to all is some form of "zero assumption" to render the mixture model identifiable. Typically, for large <italic>p</italic>-values one assumes that there is no contamination with the alternative distribution, i.e. Fndr(<italic>p </italic>→ 1) = 0 and therefore <italic>f</italic>(<italic>p </italic>→ 1) = <italic>η</italic><sub>0</sub></p> <title>Local FDR</title> <p>An alternative to the classic tail-area based FDR is the local FDR, abbreviated here as "fdr". Specifically, the local FDR is the probability of the null model conditioned the observed test statistic (see Table ##TAB##0##1##). Note that the local FDR takes is computed at the density level, in contrast to the Fdr that is based on cumulative densities.</p> <p>This approach has mainly been advocated by Efron and a few others [##UREF##9##13##, ####UREF##10##14##, ##REF##15350197##15####15350197##15##]. The key virtue of local FDR is that it is more readily interpretable than Fdr, as it is an empirical Bayesian posterior probability and not some variant of a corrected <italic>p</italic>-value. However, due to the use of densities it is also more difficult to estimate, in particular if the alternative distribution in the two-component model is not parametrically specified.</p> <p>An important relation between Fdr and fdr is the property Fdr(<italic>p</italic>) ≤ fdr(<italic>p</italic>) that holds if fdr(<italic>p</italic>) is monotonically decreasing with decreasing <italic>p</italic>-value.</p> <title>Test statistics other than <italic>p</italic>-values and empirical null modeling</title> <p>Virtually all FDR procedures – both local and tail area-based methods – are designed to work with <italic>p</italic>-values as input test statistics. Regardless the popularity of <italic>p</italic>-value-based approaches, in many instances it is often more beneficial to base the FDR calculations on the actual test statistic, such as on a regularized <italic>t</italic>-score, a <italic>z</italic>-score, or a correlation, rather than on a <italic>p</italic>-value.</p> <p>The reason for this is as follows. Very often the theoretical null model is misspecified, due to dependencies among test statistics and other factors [##UREF##11##16##]. In turn, this may lead to overly pessimistic or too optimistic <italic>p</italic>-values, and thus to a violation of the implicit assumption of the FDR two-component model for <italic>p</italic>-values (namely that the null <italic>p</italic>-values are drawn from the uniform distribution). In such a case the resulting FDR values will also be biased, and thus unreliable.</p> <p>Efron has shown that this can be elegantly avoided by retaining free parameters in the null model for the original test statistics (typically for location or scale) and estimating these parameters from the data [##UREF##2##4##]. Intriguingly, this <italic>empirical null modeling </italic>is greatly facilitated by high dimensions – and hence it is one of the few instances where high-dimensionality is not a curse but a blessing. There are various attempts to take account of the dependencies among <italic>p</italic>-values in FDR calculations, however it seems much more natural (and easier) to simply conduct Fdr and fdr calculations on the level of the original test statistic whilst employing an empirical null. In a recent paper these considerations are confirmed from a decision theoretic point of view [##UREF##12##17##].</p> <p>Despite these apparent advantages empirical null modeling is currently available in only two FDR estimation algorithms, "locfdr" [##UREF##2##4##] and "fdrtool" (this paper). Note that fitting an empirical null is not tied to <italic>z</italic>-scores and the assumption of a normal null distribution, it is equally well feasible for any other test statistic, e.g., correlations [##REF##15479708##3##].</p> <title>Unified procedure for FDR estimation</title> <title>Overview and motivation</title> <p>From the discussion in the previous section it is clear that there exists a veritable range of FDR-related methods. An brief overview is given in Table ##TAB##1##2##, which lists thirteen FDR procedures for which an implementation for the R platform [##UREF##13##18##] is available.</p> <p>The aim of this paper is to introduce an FDR estimation procedure that brings together many aspects that otherwise are only considered separately into one common and coherent setting. Thus, in a sense this offers a unified algorithm for FDR analysis.</p> <p>Specifically, a procedure is proposed</p> <p>• for the simultaneous estimation of both Fdr and fdr, regardless of the type of test statistic,</p> <p>• that does not treat <italic>p</italic>-values any different from other test statistics,</p> <p>• that maintains the ordering of original test statistics,</p> <p>• that uses efficient and well tested techniques for estimating <italic>η</italic><sub>0 </sub>and null distribution,</p> <p>• and that remains (largely) compatible with the well established "locfdr" and "qvalue" algorithms.</p> <p>Furthermore, the algorithm is conceptually simple. Components in this scheme for Fdr/fdr analysis are a generalized definition of the test statistic, a non-parametric density estimator, an approach of fitting the null model, combined together in an effective fashion.</p> <p>The present approach, discussed in detail in the following subsections, is best described as a marriage of the non-parametric Grenander approach of [##UREF##3##5##] and [##REF##16086831##6##] with the empirical null modeling of [##UREF##2##4##]. An implementation is available in the R package "fdrtool" [##UREF##14##19##].</p> <title>Generalized test statistic</title> <p>Central to the algorithm is a generic definition of the underlying test statistic. Specifically, a statistic <italic>y </italic>≥ 0 is considered with properties such that large values of <italic>y </italic>indicate an "interesting" case, and, conversely, small values close to zero an "uninteresting" case. Examples for suitable statistics <italic>y </italic>include:</p> <p>• <italic>y </italic>= 1 - <italic>p </italic>where <italic>p </italic>is a <italic>p</italic>-value,</p> <p>• <italic>y </italic>= |<italic>z</italic>| where <italic>z </italic>is a normal score,</p> <p>• <italic>y </italic>= |<italic>r</italic>| where <italic>r </italic>is a correlation, and</p> <p>• <italic>y </italic>= |<italic>t</italic>| where <italic>t </italic>is a <italic>t</italic>-score.</p> <p>Note that the choice of test statistic <italic>y </italic>automatically implies a corresponding null model <italic>f</italic><sub>0</sub>(<italic>y</italic>; <italic>θ</italic>), e.g., the uniform, half-normal, etc., which possibly contains some parameters <italic>θ</italic>. In terms of <italic>y </italic>the two-component model becomes</p> <p></p> <p>and</p> <p></p> <p>Accordingly, for a test statistic <italic>y </italic>the local FDR and the tail area-based FDR are given by</p> <p></p> <p>and</p> <p></p> <p>Furthermore, the <italic>p</italic>-value corresponding to the test statistic <italic>y </italic>equals 1 - <italic>F</italic><sub>0</sub>(<italic>y</italic>; <italic>θ</italic>).</p> <title>Density estimation using a modified Grenander approach</title> <p>A central part of FDR analysis consists of the estimation of the marginal density <italic>f</italic>(<italic>p</italic>) and the associated distribution function <italic>F</italic>(<italic>p</italic>) from <italic>p</italic>-values <italic>p</italic><sub><italic>i</italic></sub>corresponding to the observed test statistics <italic>y</italic><sub><italic>i</italic></sub>.</p> <p>The most simple approach is to use the empirical cumulative density function (ECDF) as estimator of <italic>F</italic>(<italic>p</italic>). Note that the ECDF is the non-parametric maximum-likelihood estimate (NPMLE). The ECDF is very widely used in FDR analysis, including the two most popular FDR approaches (BH rule, "qvalue" algorithm). However, the ECDF has the disadvantage that it requires careful post-processing in order to achive monotone FDR values. Furthermore, it is a non-trivial issue to derive a density from the ECDF (see, e.g., [##REF##15350197##15##] for an approach using loess smoothing). This important if computation of local FDR values is desired.</p> <p>Another popular option, pursued in the "locfdr" program, is to estimate the density by spline Poisson regression on the histogram counts [##UREF##15##21##]. This work extremely well in general but can be problematic if the distribution has a strong peak – which is not uncommon, e.g., for <italic>p</italic>-values or partial correlations. Furthermore, this approach introduces additional parameters such as the histogram bin width or the degrees of freedom of the spline, which for some data may need diligent adjustment. In addition, as the approach does not place any monotonicity constraints on the density there is no guarantee that the order of the scores is maintained in the corresponding FDR values.</p> <p>Other possibilities recently proposed for FDR density estimation include, e.g., normal mixtures [##REF##16632494##22##], kernel-based approaches [##UREF##16##23##] and Bernstein polynomials [##UREF##17##24##].</p> <p>An further alternative approach is provided by the Grenander density estimator [##UREF##18##25##]. In contrast to most other density estimators it has two main benefits which are highly useful in the context of FDR estimation: it explicitly incorporates monotonicity constraints (to preserve ordering of original test statistics) and provides simultaneous estimates of both PDF and CDF (to allow computation of both fdr and Fdr). Nonetheless, it is only slightly more complicated than than the ECDF. For FDR analysis the Grenander estimator has been first suggested by [##UREF##3##5##] and by [##REF##16086831##6##].</p> <p>Fig. ##FIG##1##2## illustrates the mechanics behind Grenander density estimate. In essence, the Grenander density estimator is the decreasing piecewise-constant function equal to the slopes of the least concave majorant (LCM) of the ECDF. In the example shown in Fig. ##FIG##1##2## the data <italic>x </italic>are <italic>n </italic>= 30 random samples from the exponential distribution with mean one. The left part of the figure shows the estimated monotonically decreasing density and the right part the corresponding empirical cumulative distribution. Note that the resulting distribution <italic>F </italic>is piecewise linear, whereas the density <italic>f </italic>is piecewise constant. The Grenander estimator is easy to obtain, as the LCM of the ECDF can be computed by monotone regression with weights [##UREF##19##26##]. Specifically, let <italic>x</italic><sub><italic>i </italic></sub>and <italic>y</italic><sub><italic>i </italic></sub>denote the coordinates for the ECDF, and Δ<italic>x</italic><sub><italic>i </italic></sub>= <italic>x</italic><sub><italic>i</italic>+1 </sub>- <italic>x</italic><sub><italic>i </italic></sub>and Δ<italic>y</italic><sub><italic>i</italic></sub>= <italic>y</italic><sub><italic>i</italic>+1 </sub>- <italic>y</italic><sub><italic>i</italic></sub>. The slopes of the LCM are then given by antitonic regression of the raw slopes Δ<italic>x</italic><sub><italic>i</italic></sub>/Δ<italic>y</italic><sub><italic>i </italic></sub>with weight Δ<italic>x</italic><sub><italic>i </italic></sub>(see also the corresponding functions monoreg, lcmgcm and grenander in the "fdrtool" package). Like the ECDF, the Grenander estimator is also the NPMLE, with the added constraint of an underlying decreasing density.</p> <p>Unfortunately, the standard Grenander estimator exhibits a severe shortcoming when applied the two-component FDR model: it leads to inconsistencies with the estimated <italic>η</italic><sub>0</sub>. This problem is extensively discussed in [##UREF##3##5##], and in fact causes these authors to abandon the Grenander estimator despite its favorable properties.</p> <p>The point that is made here is that this deficiency can be easily fixed. Specifically, it is argued that the Grenander estimator is indeed very well suited for FDR analysis, but needs further modification in order to satisfy the additional constraints imposed by the two-component model.</p> <p>The key problem can be understood best by going back to Eq. 3 which describes the FDR <italic>p</italic>-value mixture model on the level of the CDF. Effectively, this equation implies two constraints that any distribution compatible with the two-component model must satisfy:</p> <p>• First, the CDF has to fulfill the condition <italic>F</italic>(<italic>p</italic>) ≥ <italic>η</italic><sub>0</sub><italic>p </italic>because <italic>F</italic>(<italic>p</italic>) = <italic>η</italic><sub>0</sub><italic>p </italic>+ (1 - <italic>η</italic><sub>0</sub>)<italic>F</italic><sub><italic>A</italic></sub>(<italic>p</italic>).</p> <p>• Second, the condition 1 - <italic>F</italic>(<italic>p</italic>) ≥ <italic>η</italic><sub>0</sub>(1 - <italic>p</italic>) must be met, because of</p> <p>1 - <italic>F</italic>(<italic>p</italic>) = <italic>η</italic><sub>0</sub>(1 - <italic>p</italic>) + (1 - <italic>η</italic><sub>0</sub>)(1 - <italic>F</italic><sub><italic>A</italic></sub>(<italic>p</italic>)).</p> <p>The second constraint is easy to overlook but is particularly important as Fig. ##FIG##2##3## illustrates. There, it can be seen that the two-component model enforces a corridor of allowed values of the ECDF, where the width of this corridor depends on the parameter <italic>η</italic><sub>0</sub>. Note that the upper boundary (second constraint) ensures that the <italic>minimum </italic>possible slope equals <italic>η</italic><sub>0</sub>.</p> <p>For FDR calculation this has the following consequence. The ECDF need not only be modified for monotonicity (Grenander estimator) but also need to be tailored to fit the constraints of the two-component model. This can be done as follows:</p> <p>1. Compute the ECDF on the basis of the <italic>p</italic>-values.</p> <p>2. Given <italic>η</italic><sub>0 </sub>impose the mixture model conditions on the ECDF for the <italic>p</italic>-values. Specifically, set (<italic>p</italic><sub><italic>i</italic></sub>) = <italic>η</italic><sub>0</sub><italic>p</italic><sub><italic>i </italic></sub>if (<italic>p</italic><sub><italic>i</italic></sub>) &lt;<italic>η</italic><sub>0</sub><italic>p</italic><sub><italic>i </italic></sub>(i.e. obey the lower boundary shown in Fig. ##FIG##2##3##) and likewise set (<italic>p</italic><sub><italic>i</italic></sub>) = 1 - <italic>η</italic><sub>0 </sub>(1 - <italic>p</italic><sub><italic>i</italic></sub>) if (<italic>p</italic><sub><italic>i</italic></sub>) &gt; 1 - <italic>η</italic><sub>0 </sub>(1 - <italic>p</italic><sub><italic>i</italic></sub>) (upper boundary).</p> <p>3. The "modified" Grenander estimator is obtained as the standard Grenander estimator computed from the modified ECDF.</p> <p>Note that the modified Grenander estimator retains the key property of the standard Grenander estimator (i.e. monotonicity) but in addition satisfies the constraints imposed by the two-component mixture model model. In particular, there are no inconsistencies with respect to the parameter <italic>η</italic><sub>0</sub>. This is illustrated in Fig. ##FIG##3##4## where the modified Grenander estimator is applied with three different settings of <italic>η</italic><sub>0 </sub>to an example <italic>p</italic>-value data set. Note that by construction the modified Grenander density equals <italic>η</italic><sub>0 </sub>for large <italic>p</italic>-values.</p> <title>Estimation of null sub-density by truncated maximum-likelihood</title> <p>For computing <italic>p</italic>-values and the modified Grenander density suitable estimates of the parameters <italic>θ </italic>and <italic>η</italic><sub>0 </sub>are required. In other words, the null sub-density <italic>η</italic><sub>0</sub><italic>f</italic><sub>0</sub>(<italic>y</italic>; <italic>θ</italic>) of the two-component model (Eqs. 4 and 5) needs to be fit to the observed test statistics. This is straightforward in fully parametric models such as BUM [##REF##12835267##27##]. However, it is often preferred to leave <italic>f</italic><sub><italic>A</italic></sub>(<italic>y</italic>) unspecified. As a consequence, standard procedures for inferring mixture models such as the EM algorithm cannot be applied.</p> <p>Instead, a truncated maximum-likelihood approach is applied here. In more detail, in this method the data are <italic>censored </italic>at some threshold <italic>y</italic><sub><italic>c</italic></sub>, so that only test statistics <bold>y</bold><sub><italic>t </italic></sub>= {<italic>y</italic><sub><italic>i </italic></sub>: <italic>y</italic><sub><italic>i </italic></sub>&lt;<italic>y</italic><sub><italic>c</italic></sub>} are retained. The underlying assumptions is that for <italic>y</italic><sub><italic>i </italic></sub>&lt;<italic>y</italic><sub><italic>c </italic></sub>(nearly) all data points belong to the null part. This is called the "strong zero assumption" in [##UREF##20##28##]. The truncated null density becomes (<italic>y</italic>; <italic>θ</italic>) = <italic>f</italic><sub>0</sub>(<italic>y</italic>; <italic>θ</italic>)/<italic>F </italic>(<italic>y</italic><sub><italic>c</italic></sub>; <italic>θ</italic>) for <italic>y &lt; y</italic><sub><italic>c </italic></sub>and  = 0 otherwise. Maximization of the corresponding likelihood function returns  as well as an estimate of its asymptotic error. Similarly, the proportion of null values <italic>η</italic><sub>0 </sub>is inferred by assuming a binomial model for the observed number <italic>m</italic><sub><italic>t </italic></sub>of hypotheses in the set <bold>y</bold><sub><italic>t</italic></sub>, which leads to the simple estimate  plus an associated error.</p> <p>Truncated maximum-likelihood is the basis of the "locfdr" MLE algorithm [##UREF##21##29##,##UREF##20##28##]. If the test statistics are <italic>p</italic>-values then the truncated maximum-likelihood algorithm reduces to the simple cutoff technique used in "qvalue" and most other <italic>p</italic>-value-based packages.</p> <title>Selection of suitable truncation point using the false non-discovery rate</title> <p>Fitting the null model and the associated parameters <italic>θ </italic>and <italic>η</italic><sub>0 </sub>by truncated maximum-likelihood depends on the choice of a suitable cutoff point <italic>y</italic><sub><italic>c</italic></sub>. In general, one wishes to select <italic>y</italic><sub><italic>c </italic></sub>such that the threshold is small enough to ensure that the zero assumption is met and that there is minimal bias due to contamination with the alternative <italic>f</italic><sub><italic>A</italic></sub>(<italic>y</italic>). On the other hand, <italic>y</italic><sub><italic>c </italic></sub>needs be chosen large enough so that the number of data points in <bold>y</bold><sub><italic>t </italic></sub>is sufficient for reliably estimating <italic>θ </italic>and <italic>η</italic><sub>0</sub>.</p> <p>The default "smoothing" approach employed in "qvalue" specifically aims at achieving an unbiased estimate of <italic>η</italic><sub>0 </sub>[##REF##12883005##7##]. This is obtained by varying the cutoff point between zero and one, and subsequently estimating <italic>η</italic><sub>0 </sub>by interpolation at <italic>y</italic><sub><italic>c </italic></sub>= 1, i.e. for complete censoring.</p> <p>For empirical null modeling the choice of an optimal <italic>y</italic><sub><italic>c </italic></sub>is more complicated. Table ##TAB##2##3## lists the algorithms employed in various versions of the "locfdr" algorithm. Essentially, "locfdr" either uses a fixed <italic>y</italic><sub><italic>c </italic></sub>or it relies on a heuristic analytical formula aimed at reducing the mean squared error of the null sub-density [##UREF##20##28##]. Both approaches are not straightforward to extend to arbitrary test statistics <italic>y</italic><sub><italic>i</italic></sub>. Instead, here a more simple alternative procedure is proposed that enforces the "zero assumption" by requiring that the false non-discovery rate (Fndr) is minimized (i.e. <italic>y</italic><sub><italic>c </italic></sub>is chosen such that Fndr(<italic>y</italic><sub><italic>c</italic></sub>) is small). Intriguingly, this leads to the following circular inferential problem: in order to determine a suitable cutoff <italic>y</italic><sub><italic>c </italic></sub>the Fndr must be known, yet to compute Fndr and other FDR quantities a suitable value for <italic>y</italic><sub><italic>c </italic></sub>must be specified. Fortunately, for most data sets the location of the cutoff point <italic>y</italic><sub><italic>c </italic></sub>need only be known approximately. The "FNDR" strategy employed in "fdrtool" proceeds in two stages. In the first step, the mixture model is fit approximately, which leads to an approximate Fndr curve from which an approximately optimal <italic>y</italic><sub><italic>c </italic></sub>is obtained. In the second step truncated maximum-likelihood estimation on the basis of the approximate cutoff <italic>y</italic><sub><italic>c </italic></sub>is used for a refined fit of the mixture model which in turn allows to compute FDR quantities of interest.</p> <p>A simple approximate fit of the null model is achieved by matching its median  (1/2; <italic>θ</italic>) with that of the observed <italic>y</italic><sub><italic>i</italic></sub>. Thus, a robust estimate of scale is used just as in the "locfdr" algorithm, see Table ##TAB##2##3## (note that the median for the half-normal distribution corresponds to the interquartile range (IQR) of the corresponding normal with mean zero). Subsequently, after converting the test statistics into <italic>p</italic>-values an approximate estimate of the null proportion is determined by estimating <italic>η</italic><sub>0 </sub>for various cutoff-points and finally settling for the 0.1 quantile of the resulting distribution of corresponding <italic>η</italic><sub>0</sub>.</p> <p>In addition to selecting <italic>y</italic><sub><italic>c </italic></sub>by the above "FNDR" approach, further methods available in the "fdrtool" package include the "locfdr" cutoff method [##UREF##20##28##] and the specification of the fraction of data points to be considered for estimating the empirical null. In a practical analysis it is always advisable to conduct the FDR calculations for various choices of <italic>y</italic><sub><italic>c</italic></sub>, (even though truncated maximum-likelihood appears to be fairly robust with regard to <italic>y</italic><sub><italic>c</italic></sub>).</p> <title>Gluing it all together</title> <p>With the above preliminaries, a general algorithm for estimating Fdr and fdr from an arbitrary test statistics <italic>y</italic><sub><italic>i </italic></sub>can be put together as follows:</p> <p>1. Determine a suitable truncation point <italic>y</italic><sub><italic>c</italic></sub>.</p> <p>2. Estimate the null model and its parameters, yielding  and .</p> <p>3. Convert test statistics into <italic>p</italic>-values via <italic>p</italic><sub><italic>i </italic></sub>= 1 - <italic>F</italic><sub>0</sub>(<italic>y</italic>|).</p> <p>4. Estimate the PDF (<italic>p</italic>) and CDF (<italic>p</italic>) of the <italic>p</italic>-values using the modified Grenander estimator (note that this requires ).</p> <p>5. Compute estimates of Fdr and fdr values based on <italic>p</italic>-values:</p> <p></p> <p>6. Compute estimated Fdr and fdr values as a function of the original test statistics <italic>y</italic>:</p> <p></p> <p>7. Compute CDF and PDF on the <italic>y</italic>-scale:</p> <p></p> <p>Note that this transformation is directly derived from the definition of fdr and Fdr in Eqs. 6 and 7.</p> <p>8. Estimate alternative sub-density:</p> <p></p>
<title>Results and discussion</title> <title>Computer simulations for <italic>p</italic>-value-based analyses</title> <p>In order to assess the performance of the "fdrtool" algorithm it was compared with a number of other FDR procedures. Specifically, the R packages "fdrtool" version 1.2.4, "qvalue" version 1.1 [##REF##12883005##7##], "locfdr" version 1.1–6 [##UREF##2##4##], "twilight" version 1.14.1 [##UREF##22##30##], "kerfdr" version 1.0.0 [##UREF##16##23##] and "nFDR" version 0.0 [##UREF##17##24##] were investigated.</p> <p>First, FDR approaches based on <italic>p</italic>-values were studied. As generative model <italic>p</italic>-values were simulated from a mixture of the uniform <italic>U</italic>(0, 1) with either the truncated exponential density  or with the uniform <italic>f</italic><sub><italic>A</italic></sub>(<italic>p</italic>; <italic>a</italic>) = <italic>U </italic>(0, <italic>a</italic>). Sample size and mixture model parameter <italic>a </italic>were varied, and from each generated data set the proportion of null <italic>p</italic>-values, and the squared error of the local FDR and the tail area-based FDR was estimated. The references for computing the squared error were the theoretical Fdr and fdr values derived from the assumed model.</p> <p>Fig. ##FIG##4##5## displays the results for three different cases: "model 1" is a uniform-exponential mixture with <italic>η</italic><sub>0 </sub>= 0.8 and <italic>a </italic>= 5, "model 2" is identical to "model 1" except for <italic>a </italic>= 20, and "model 3" utilizes the uniform-uniform mixture with <italic>a </italic>= 0.2. In all cases there were <italic>B </italic>= 1000 repeats and the number of <italic>p</italic>-values was <italic>m </italic>= 200.</p> <p>The first column of Fig. ##FIG##4##5## shows the accuracy in estimating <italic>η</italic><sub>0</sub>. Overall, the "kerfdr" and the "fdrtool" algorithms exhibit the smallest variability at the expense of a slightly biased estimate of <italic>η</italic><sub>0</sub>, especially for "model 1". In contrast, "qvalue" always produces nearly unbiased estimates but has a much higher variance. The "twilight" and "nFDR" are similar to "qvalue", but are less variable.</p> <p>The second and third columns of Fig. ##FIG##4##5## depict the error in the actually estimated Fdr and fdr values for various algorithms under the three model scenarios. In terms of correctly estimating fdr values all investigated packages with capability of computing local FDR (i.e. "fdrtool", "kerfdr", and "twilight") perform roughly equally well across all scenarios For "model 3" the "fdrtool" appears to have a slight advantage over the competing approaches. When comparing the accuracy of Fdr values "fdrtool" outperforms both "qvalue" and "nFDR", even though the differences are not large. The squared error of Fdr computed by "qvalue" and by "nFDR" exhibits more extreme outliers than those of "fdrtool".</p> <title>Simulations and analysis of gene expression data for <italic>z</italic>-scores</title> <p>In a further simulation study estimation of FDR from <italic>z</italic>-scores was considered with empirical null modeling. Specifically, data were simulated from a mixture of the normal distribution <italic>N</italic>(<italic>μ </italic>= 0, <italic>σ </italic>= 2) with the symmetric uniform alternatives <italic>U</italic>(-10, -5) and <italic>U</italic>(5, 10).</p> <p>An example of the results from the simulations for sample size <italic>m </italic>= 200, <italic>B </italic>= 1000 repeats and <italic>η</italic><sub>0 </sub>= 0.8 is shown in Fig. ##FIG##5##6##. The estimates of the mixing parameter <italic>η</italic><sub>0 </sub>and of the scale parameter <italic>s </italic>are slightly upwardly biased in "locfdr" but more importantly they also exhibit larger variability compared to "fdrtool". The mean squared error of the fdr vales are similar for both algorithms. Note that in this simulation a 75% quantile cutoff point was employed in "fdrtool" for the truncated maximum-likelihood estimation of the null model. The third row of Fig. ##FIG##5##6## shows the FDR errors for <italic>z</italic>-scores with absolute values larger than 2. In this domain both investigated algorithms perform again very similar, but the average error is larger in comparison to the situation when all <italic>z</italic>-scores are included in the analysis. In order to further compare the empirical null modeling a HIV and a breast cancer (BRCA) microarray gene expression data set was reanalyzed, following [##UREF##23##31##] and [##UREF##2##4##]. For the detailed biological background and the experimental setup it is referred to the original papers.</p> <p>The HIV data consists of 7680 <italic>z</italic>-scores. The fit of "fdrtool" to the median-centered data is shown in Fig. ##FIG##6##7##. Specifically, the standard deviation of the null normal density was estimated to be  = 0.786 and the mixing parameter  = 0.9575. The number of discoveries with a fdr value smaller than 0.2 was 119. The "locfdr" algorithm finds a very similar null model, namely  = 0.754 and  = 0.9342. Corresponding to the smaller  "locfdr" detects 160 significant <italic>z</italic>-scores with fdr &lt; 0.2.</p> <p>The breast cancer data has size 3226. After median-centering the data were again supplied to both the "fdrtool" and "locfdr" packages. Both algorithms indicated that there was overdispersion ( = 1.51 versus  = 1.55) and and the proportion of null values was estimated to be  = 1. Correspondingly, for the BRCA data there were no significant <italic>z</italic>-scores (note that this is in contrast to claims otherwise in [##UREF##23##31##]). In short, "fdrtool" and "locfdr" provide very similar analyzes both in terms of empirical null estimation and inferred fdr values.</p> <title>Computational efficiency</title> <p>Finally, the investigated FDR procedures were also compared in terms of computational efficiency. The (by a large margin) slowest program is "twilight". In contrast, the fastest algorithms are "fdrtool", "locfdr" and "qvalue", followed by "kerfdr" and "nFDR".</p>
<title>Results and discussion</title> <title>Computer simulations for <italic>p</italic>-value-based analyses</title> <p>In order to assess the performance of the "fdrtool" algorithm it was compared with a number of other FDR procedures. Specifically, the R packages "fdrtool" version 1.2.4, "qvalue" version 1.1 [##REF##12883005##7##], "locfdr" version 1.1–6 [##UREF##2##4##], "twilight" version 1.14.1 [##UREF##22##30##], "kerfdr" version 1.0.0 [##UREF##16##23##] and "nFDR" version 0.0 [##UREF##17##24##] were investigated.</p> <p>First, FDR approaches based on <italic>p</italic>-values were studied. As generative model <italic>p</italic>-values were simulated from a mixture of the uniform <italic>U</italic>(0, 1) with either the truncated exponential density  or with the uniform <italic>f</italic><sub><italic>A</italic></sub>(<italic>p</italic>; <italic>a</italic>) = <italic>U </italic>(0, <italic>a</italic>). Sample size and mixture model parameter <italic>a </italic>were varied, and from each generated data set the proportion of null <italic>p</italic>-values, and the squared error of the local FDR and the tail area-based FDR was estimated. The references for computing the squared error were the theoretical Fdr and fdr values derived from the assumed model.</p> <p>Fig. ##FIG##4##5## displays the results for three different cases: "model 1" is a uniform-exponential mixture with <italic>η</italic><sub>0 </sub>= 0.8 and <italic>a </italic>= 5, "model 2" is identical to "model 1" except for <italic>a </italic>= 20, and "model 3" utilizes the uniform-uniform mixture with <italic>a </italic>= 0.2. In all cases there were <italic>B </italic>= 1000 repeats and the number of <italic>p</italic>-values was <italic>m </italic>= 200.</p> <p>The first column of Fig. ##FIG##4##5## shows the accuracy in estimating <italic>η</italic><sub>0</sub>. Overall, the "kerfdr" and the "fdrtool" algorithms exhibit the smallest variability at the expense of a slightly biased estimate of <italic>η</italic><sub>0</sub>, especially for "model 1". In contrast, "qvalue" always produces nearly unbiased estimates but has a much higher variance. The "twilight" and "nFDR" are similar to "qvalue", but are less variable.</p> <p>The second and third columns of Fig. ##FIG##4##5## depict the error in the actually estimated Fdr and fdr values for various algorithms under the three model scenarios. In terms of correctly estimating fdr values all investigated packages with capability of computing local FDR (i.e. "fdrtool", "kerfdr", and "twilight") perform roughly equally well across all scenarios For "model 3" the "fdrtool" appears to have a slight advantage over the competing approaches. When comparing the accuracy of Fdr values "fdrtool" outperforms both "qvalue" and "nFDR", even though the differences are not large. The squared error of Fdr computed by "qvalue" and by "nFDR" exhibits more extreme outliers than those of "fdrtool".</p> <title>Simulations and analysis of gene expression data for <italic>z</italic>-scores</title> <p>In a further simulation study estimation of FDR from <italic>z</italic>-scores was considered with empirical null modeling. Specifically, data were simulated from a mixture of the normal distribution <italic>N</italic>(<italic>μ </italic>= 0, <italic>σ </italic>= 2) with the symmetric uniform alternatives <italic>U</italic>(-10, -5) and <italic>U</italic>(5, 10).</p> <p>An example of the results from the simulations for sample size <italic>m </italic>= 200, <italic>B </italic>= 1000 repeats and <italic>η</italic><sub>0 </sub>= 0.8 is shown in Fig. ##FIG##5##6##. The estimates of the mixing parameter <italic>η</italic><sub>0 </sub>and of the scale parameter <italic>s </italic>are slightly upwardly biased in "locfdr" but more importantly they also exhibit larger variability compared to "fdrtool". The mean squared error of the fdr vales are similar for both algorithms. Note that in this simulation a 75% quantile cutoff point was employed in "fdrtool" for the truncated maximum-likelihood estimation of the null model. The third row of Fig. ##FIG##5##6## shows the FDR errors for <italic>z</italic>-scores with absolute values larger than 2. In this domain both investigated algorithms perform again very similar, but the average error is larger in comparison to the situation when all <italic>z</italic>-scores are included in the analysis. In order to further compare the empirical null modeling a HIV and a breast cancer (BRCA) microarray gene expression data set was reanalyzed, following [##UREF##23##31##] and [##UREF##2##4##]. For the detailed biological background and the experimental setup it is referred to the original papers.</p> <p>The HIV data consists of 7680 <italic>z</italic>-scores. The fit of "fdrtool" to the median-centered data is shown in Fig. ##FIG##6##7##. Specifically, the standard deviation of the null normal density was estimated to be  = 0.786 and the mixing parameter  = 0.9575. The number of discoveries with a fdr value smaller than 0.2 was 119. The "locfdr" algorithm finds a very similar null model, namely  = 0.754 and  = 0.9342. Corresponding to the smaller  "locfdr" detects 160 significant <italic>z</italic>-scores with fdr &lt; 0.2.</p> <p>The breast cancer data has size 3226. After median-centering the data were again supplied to both the "fdrtool" and "locfdr" packages. Both algorithms indicated that there was overdispersion ( = 1.51 versus  = 1.55) and and the proportion of null values was estimated to be  = 1. Correspondingly, for the BRCA data there were no significant <italic>z</italic>-scores (note that this is in contrast to claims otherwise in [##UREF##23##31##]). In short, "fdrtool" and "locfdr" provide very similar analyzes both in terms of empirical null estimation and inferred fdr values.</p> <title>Computational efficiency</title> <p>Finally, the investigated FDR procedures were also compared in terms of computational efficiency. The (by a large margin) slowest program is "twilight". In contrast, the fastest algorithms are "fdrtool", "locfdr" and "qvalue", followed by "kerfdr" and "nFDR".</p>
<title>Conclusion</title> <p>False discovery rate analysis is a key statistical innovation that has found widespread application in the study of high-dimensional data. One of the intriguing aspects of FDR is that can be understood both from a frequentist and Bayesian perspective. This has lead to a plethora of FDR criteria and FDR inference procedures.</p> <p>The goal for the development of the "fdrtool" procedure was to establish a common framework that brings together the most compelling features of existing FDR methods. Specifically, novel features of the proposed "fdrtool" algorithm include</p> <p>• a unified treatment of <italic>p</italic>-values and other test statistics, with identical algorithms and learning procedures,</p> <p>• simultaneous and coherent estimation of both Fdr and fdr,</p> <p>• empirical null modeling for test statistics other than <italic>z</italic>-scores,</p> <p>• a method for selecting the truncation point based on controlling FNDR, and</p> <p>• a simple semiparametric model using a modified Grenander density estimator.</p> <p>Hence, "fdrtool" allows to compute local FDR values from <italic>p</italic>-values but also Fdr values from <italic>z</italic>-scores while taking account of an empirical null model. Despite the generality of the algorithm, it was shown that the accuracy of the algorithm is on par with the best competing yet more specialized FDR procedures. Moreover, the modular structure of the "fdrtool" procedure facilitates future extensions.</p> <p>In summary, the "fdrtool" package and algorithm constitutes a comprehensive and feature-rich tool for a wide range of FDR-type analyzes.</p> <p>During revision a referee pointed out that the distribution of observed <italic>p</italic>-values might be <italic>U</italic>-shaped [##REF##16777905##20##]. This occurs, among other possibilities, if the null model is misspecified. As a result, the computed null <italic>p</italic>-values do not follow a uniform distribution, and thus by definition are improper. "fdrtool" cannot be applied directly to improper <italic>p</italic>-values, however, in these instances it might instead be preferable to conduct the FDR analysis on the level of the original test statistics.</p>
<p>This is an Open Access article distributed under the terms of the Creative Commons Attribution License (<ext-link ext-link-type="uri" xlink:href="http://creativecommons.org/licenses/by/2.0"/>), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</p> <title>Background</title> <p>False discovery rate (FDR) methods play an important role in analyzing high-dimensional data. There are two types of FDR, tail area-based FDR and local FDR, as well as numerous statistical algorithms for estimating or controlling FDR. These differ in terms of underlying test statistics and procedures employed for statistical learning.</p> <title>Results</title> <p>A unifying algorithm for simultaneous estimation of both local FDR and tail area-based FDR is presented that can be applied to a diverse range of test statistics, including <italic>p</italic>-values, correlations, <italic>z</italic>- and <italic>t</italic>-scores. This approach is semipararametric and is based on a modified Grenander density estimator. For test statistics other than <italic>p</italic>-values it allows for empirical null modeling, so that dependencies among tests can be taken into account. The inference of the underlying model employs truncated maximum-likelihood estimation, with the cut-off point chosen according to the false non-discovery rate.</p> <title>Conclusion</title> <p>The proposed procedure generalizes a number of more specialized algorithms and thus offers a common framework for FDR estimation consistent across test statistics and types of FDR. In comparative study the unified approach performs on par with the best competing yet more specialized alternatives. The algorithm is implemented in R in the "fdrtool" package, available under the GNU GPL from <ext-link ext-link-type="uri" xlink:href="http://strimmerlab.org/software/fdrtool/"/> and from the R package archive CRAN.</p>
<title>Acknowledgements</title> <p>I thank Brit B. Turnbull (Stanford) for discussing the FDR algorithm implemented in "locfdr" and for kindly sending an early preprint. I thank Florian Leitenstorfer (Munich) for discussion and insights concerning monotone regression. I also would like to thank the three anonymous referees for their very helpful and detailed comments.</p>
<fig position="float" id="F1"><label>Figure 1</label><caption><p><bold>Two-component mixture model for <italic>p</italic>-values with cutoff point <italic>y</italic><sub><italic>c</italic></sub>. This implies a decision rule with errors <italic>α</italic><sub>1 </sub>and <italic>α</italic><sub>2</sub>.</bold> Further abbreviations: FP, false positives; TP, true positives; FN, false negatives; TN, true negatives. Note that here these quantities are all fractions (not counts) and that FP + TP + FN + TN = 1.</p></caption></fig> <fig position="float" id="F2"><label>Figure 2</label><caption><p><bold>Illustration of the Grenander density estimator.</bold> Left: Grenander density estimate (blue line); right: the corresponding concave distribution function (blue line) and the underlying ECDF (thine black lines).</p></caption></fig> <fig position="float" id="F3"><label>Figure 3</label><caption><p><bold>Constraints imposed by the <italic>p</italic>-value mixture model on the ECDF of <italic>p</italic>-values.</bold> The lower diagonal line corresponds to the constraint <italic>F</italic>(<italic>p</italic>) ≥ <italic>η</italic><sub>0</sub><italic>p </italic>whereas the upper diagonal line represents the constraint 1 - <italic>F</italic>(<italic>p</italic>) ≥ <italic>η</italic><sub>0</sub>(1 - <italic>p</italic>). Right: the unmodified ECDF; left: the ECDF subject to the constraint <italic>η</italic><sub>0 </sub>= 0.7.</p></caption></fig> <fig position="float" id="F4"><label>Figure 4</label><caption><p><bold>The modified Grenander estimator computed from <italic>p</italic>-values for three different choices of <italic>η</italic><sub>0</sub>.</bold> Note that the underlying data are the same in all three instances and that the density of the modified Grenander equals <italic>η</italic><sub>0 </sub>for large <italic>p</italic>-values.</p></caption></fig> <fig position="float" id="F5"><label>Figure 5</label><caption><p><bold>Comparison of the estimates of the proportion of null <italic>p</italic>-values and the squared error of Fdr and fdr for various <italic>p</italic>-value-based FDR estimation procedures under three different simulation scenarios.</bold> The box plots summarize the estimates from <italic>B </italic>= 1000 repetitions of the simulations. The sample size (i.e. the number of multiple tests) was <italic>m </italic>= 200.</p></caption></fig> <fig position="float" id="F6"><label>Figure 6</label><caption><p><bold>Accuracy and variability of estimates of the null proportion <italic>η</italic><sub>0 </sub>and the scale parameter <italic>s </italic>as well as the squared error of Fdr and fdr for <italic>z</italic>-score based algorithms.</bold> As in Fig. 5 <italic>m </italic>= 200 and <italic>B </italic>= 1000 was used. For the plots in the third row only <italic>z</italic>-scores with |<italic>z</italic>| &gt; 2 were used.</p></caption></fig> <fig position="float" id="F7"><label>Figure 7</label><caption><p><bold>Graphical output provided by "fdrtool" for the HIV data set.</bold> The first row shows the densities, the second the distribution function and the last row the local and tail area-based false discovery rates.</p></caption></fig>
<table-wrap position="float" id="T1"><label>Table 1</label><caption><p>Definitions of FDR quantities contrasted with that of specificity and sensitivity.</p></caption><table frame="hsides" rules="groups"><thead><tr><td align="left"><italic>Quantity</italic></td><td align="left"><italic>Definition</italic></td><td/></tr></thead><tbody><tr><td align="left">Fdr</td><td align="left">= Prob("not interesting"|<italic>Y </italic>= <italic>y</italic>)</td><td align="left"></td></tr><tr><td align="left">Fndr</td><td align="left">= Prob("interesting"|<italic>Y </italic>= <italic>y</italic>)</td><td align="left"></td></tr><tr><td colspan="3"><hr/></td></tr><tr><td align="left">Sensitivity, Power</td><td align="left">= Prob(<italic>Y </italic>= <italic>y</italic>|"interesting")</td><td align="left"></td></tr><tr><td align="left">Specificity</td><td align="left">= Prob(<italic>Y </italic>= <italic>y</italic>|"not interesting")</td><td align="left"></td></tr><tr><td colspan="3"><hr/></td></tr><tr><td align="left">fdr</td><td align="left">= Prob("not interesting"|<italic>Y </italic>= <italic>y</italic>)</td><td/></tr><tr><td align="left">fndr</td><td align="left">= Prob("interesting" <italic>|Y </italic>= <italic>y</italic>)</td><td align="left">= 1 - fdr</td></tr></tbody></table></table-wrap> <table-wrap position="float" id="T2"><label>Table 2</label><caption><p>Overview over some commonly used FDR estimation procedures.</p></caption><table frame="hsides" rules="groups"><thead><tr><td align="left"><italic>Name</italic></td><td align="left"><italic>FDR Type</italic></td><td align="left"><italic>Input Data</italic></td><td align="left"><italic>Comments</italic></td><td align="left"><italic>Description of Algorithm</italic></td></tr></thead><tbody><tr><td align="left">fdrtool</td><td align="left">fdr, Fdr</td><td align="left"><italic>p</italic>-values,</td><td align="left">Modified Grenander density,</td><td align="left">This paper</td></tr><tr><td/><td/><td align="left"><italic>z</italic>-scores,</td><td align="left">estimate, empirical null model,</td><td/></tr><tr><td/><td/><td align="left"><italic>t</italic>-scores, correlations.</td><td align="left">selection of truncation point by FNDR.</td><td/></tr><tr><td align="left">BUM</td><td align="left">fdr, Fdr</td><td align="left"><italic>p</italic>-values</td><td align="left">Completely parametric model.</td><td align="left">[##REF##12835267##27##]</td></tr><tr><td align="left">SAGx</td><td align="left">fdr, Fdr</td><td align="left"><italic>p</italic>-values</td><td align="left">Grenander density estimate.</td><td align="left">[##UREF##3##5##,##REF##16086831##6##]</td></tr><tr><td colspan="5"><hr/></td></tr><tr><td align="left">qvalue</td><td align="left">Fdr</td><td align="left"><italic>p</italic>-values</td><td align="left">Diverse estimates of <italic>η</italic><sub>0 </sub>available.</td><td align="left">[##UREF##8##12##,##REF##12883005##7##]</td></tr><tr><td align="left">nFDR</td><td align="left">Fdr</td><td align="left"><italic>p</italic>-values</td><td align="left">Bernstein polynomial density.</td><td align="left">[##UREF##17##24##]</td></tr><tr><td align="left">multtest</td><td align="left">Fdr</td><td align="left"><italic>p</italic>-values</td><td align="left">Benjamini-Hochberg algorithm.</td><td align="left">[##UREF##1##2##]</td></tr><tr><td align="left">LBE</td><td align="left">Fdr</td><td align="left"><italic>p</italic>-values</td><td align="left">Location-based estimator.</td><td align="left">[##REF##15479710##32##]</td></tr><tr><td colspan="5"><hr/></td></tr><tr><td align="left">locfdr</td><td align="left">fdr</td><td align="left"><italic>z</italic>-scores</td><td align="left">Regression spline density estimate, empirical null model.</td><td align="left">[##UREF##2##4##,##UREF##20##28##]</td></tr><tr><td align="left">nomi</td><td align="left">fdr</td><td align="left"><italic>z</italic>-values</td><td align="left">Normal mixture modeling of non-null density.</td><td align="left">[##REF##16632494##22##]</td></tr><tr><td align="left">LocalFDR</td><td align="left">fdr</td><td align="left"><italic>p</italic>-values</td><td align="left">Uses loess smoothing.</td><td align="left">[##REF##15350197##15##]</td></tr><tr><td align="left">kerfdr</td><td align="left">fdr</td><td align="left"><italic>p</italic>-values</td><td align="left">Kernel density estimator.</td><td align="left">[##UREF##16##23##]</td></tr><tr><td align="left">twilight</td><td align="left">fdr</td><td align="left"><italic>p</italic>-values</td><td align="left">KS fit of truncation point.</td><td align="left">[##UREF##22##30##]</td></tr><tr><td align="left">localFDR</td><td align="left">fdr</td><td align="left"><italic>p</italic>-values</td><td align="left">Based on stochastic order model.</td><td align="left">[##REF##15145810##33##]</td></tr></tbody></table></table-wrap> <table-wrap position="float" id="T3"><label>Table 3</label><caption><p>Various choices of normal truncation points implemented in "locfdr".</p></caption><table frame="hsides" rules="groups"><thead><tr><td align="left"><italic>Version</italic></td><td align="left"><italic>Released</italic></td><td align="left"><italic>Truncation Point</italic></td><td align="left"><italic>Reference</italic></td></tr></thead><tbody><tr><td align="left">1.1–1</td><td align="left">July 2006</td><td align="left"><italic>z</italic><sub>0 </sub>= 2</td><td/></tr><tr><td align="left">1.1–3</td><td align="left">December 2006</td><td align="left"> with <italic>b </italic>= 3.55 – 0.44 log<sub>10</sub>(<italic>m</italic>),  = median(<italic>z</italic><sub><italic>i</italic></sub>) and  = IQR(<italic>z</italic><sub><italic>i</italic></sub>)/1.349.</td><td/></tr><tr><td align="left">1.1–6</td><td align="left">November 2007</td><td align="left">as version 1.1–3, but with <italic>b </italic>= max(1, 4.3<italic>m</italic><sup>-0.112966</sup>)</td><td align="left">[##UREF##20##28##]</td></tr></tbody></table></table-wrap>
<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M1" name="1471-2105-9-303-i1" overflow="scroll"><mml:semantics><mml:mrow><mml:mi>q</mml:mi><mml:mfrac><mml:mi>i</mml:mi><mml:mi>m</mml:mi></mml:mfrac></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M2" name="1471-2105-9-303-i1" overflow="scroll"><mml:semantics><mml:mrow><mml:mi>q</mml:mi><mml:mfrac><mml:mi>i</mml:mi><mml:mi>m</mml:mi></mml:mfrac></mml:mrow></mml:semantics></mml:math></inline-formula> <disp-formula id="bmcM1"><label>(1)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M3" name="1471-2105-9-303-i2" overflow="scroll"><mml:semantics><mml:mrow><mml:mtable><mml:mtr><mml:mtd><mml:mrow><mml:msubsup><mml:mi>p</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mtext>BH</mml:mtext></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mfrac><mml:mi>m</mml:mi><mml:mrow><mml:mtext>order</mml:mtext><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac><mml:mo>,</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>...</mml:mn><mml:mo>,</mml:mo><mml:mi>m</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo>.</mml:mo></mml:mrow></mml:semantics></mml:math></disp-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M4" name="1471-2105-9-303-i3" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi>p</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mtext>Bf</mml:mtext></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mi>m</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M5" name="1471-2105-9-303-i4" overflow="scroll"><mml:semantics><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>≤</mml:mo><mml:msubsup><mml:mi>p</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mtext>BH</mml:mtext></mml:mrow></mml:msubsup><mml:mo>≤</mml:mo><mml:msubsup><mml:mi>p</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mtext>Bf</mml:mtext></mml:mrow></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <disp-formula id="bmcM2"><label>(2)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M6" name="1471-2105-9-303-i5" overflow="scroll"><mml:semantics><mml:mrow><mml:mtable><mml:mtr><mml:mtd><mml:mrow><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mi>η</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:msub><mml:mi>f</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo>−</mml:mo><mml:msub><mml:mi>η</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mi>A</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mi>η</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo>−</mml:mo><mml:msub><mml:mi>η</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mi>A</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>.</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:semantics></mml:math></disp-formula> <disp-formula id="bmcM3"><label>(3)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M7" name="1471-2105-9-303-i6" overflow="scroll"><mml:semantics><mml:mrow><mml:mtable><mml:mtr><mml:mtd><mml:mrow><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mi>η</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:msub><mml:mi>F</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo>−</mml:mo><mml:msub><mml:mi>η</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mi>A</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mi>η</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mi>p</mml:mi><mml:mo>+</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo>−</mml:mo><mml:msub><mml:mi>η</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mi>A</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>.</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:semantics></mml:math></disp-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M8" name="1471-2105-9-303-i7" overflow="scroll"><mml:semantics><mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>F</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M9" name="1471-2105-9-303-i8" overflow="scroll"><mml:semantics><mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>F</mml:mi><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mi>F</mml:mi><mml:mi>N</mml:mi><mml:mo>+</mml:mo><mml:mi>T</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M10" name="1471-2105-9-303-i9" overflow="scroll"><mml:semantics><mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M11" name="1471-2105-9-303-i10" overflow="scroll"><mml:semantics><mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>N</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:semantics></mml:math></inline-formula> <disp-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M12" name="1471-2105-9-303-i11" overflow="scroll"><mml:semantics><mml:mrow><mml:mtable><mml:mtr><mml:mtd><mml:mrow><mml:mtext>fdr</mml:mtext><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo>:</mml:mo><mml:mo>=</mml:mo><mml:mtext>Prob</mml:mtext><mml:mo stretchy="false">(</mml:mo><mml:mo>"</mml:mo><mml:mtext>not interesting</mml:mtext><mml:mo>"</mml:mo><mml:mo>|</mml:mo><mml:mi>P</mml:mi><mml:mo>≤</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>η</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:msub><mml:mi>F</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mi>F</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>η</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mi>F</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac><mml:mo>.</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:semantics></mml:math></disp-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M13" name="1471-2105-9-303-i12" overflow="scroll"><mml:semantics><mml:mrow><mml:mover accent="true"><mml:mi>F</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mtext>order</mml:mtext><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mi>m</mml:mi></mml:mfrac></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M14" name="1471-2105-9-303-i13" overflow="scroll"><mml:semantics><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>η</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:semantics></mml:math></inline-formula> <disp-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M15" name="1471-2105-9-303-i14" overflow="scroll"><mml:semantics><mml:mrow><mml:mtable><mml:mtr><mml:mtd><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>Fdr</mml:mtext></mml:mrow><mml:mo stretchy="true">^</mml:mo></mml:mover><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>η</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mn>0</mml:mn></mml:msub><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mover accent="true"><mml:mi>F</mml:mi><mml:mo>ˆ</mml:mo></mml:mover><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac><mml:mo>=</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mfrac><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>η</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mn>0</mml:mn></mml:msub><mml:mi>m</mml:mi></mml:mrow><mml:mrow><mml:mtext>order</mml:mtext><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mo>≤</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mfrac><mml:mi>m</mml:mi><mml:mrow><mml:mtext>order</mml:mtext><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac><mml:mo>.</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:semantics></mml:math></disp-formula> <disp-formula id="bmcM4"><label>(4)</label><italic>f</italic>(<italic>y</italic>) = <italic>η</italic><sub>0</sub><italic>f</italic><sub>0</sub>(<italic>y</italic>; <italic>θ</italic>) + (1 - <italic>η</italic><sub>0</sub>)<italic>f</italic><sub><italic>A</italic></sub>(<italic>y</italic>)</disp-formula> <disp-formula id="bmcM5"><label>(5)</label><italic>F</italic>(<italic>y</italic>) = <italic>η</italic><sub>0</sub><italic>F</italic><sub>0</sub>(<italic>y</italic>; <italic>θ</italic>) + (1 - <italic>η</italic><sub>0</sub>)<italic>F</italic><sub><italic>A</italic></sub>(<italic>y</italic>).</disp-formula> <disp-formula id="bmcM6"><label>(6)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M16" name="1471-2105-9-303-i15" overflow="scroll"><mml:semantics><mml:mrow><mml:mtext>fdr</mml:mtext><mml:mo stretchy="false">(</mml:mo><mml:mi>y</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mi>η</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mfrac><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>y</mml:mi><mml:mo>;</mml:mo><mml:mi>θ</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>y</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:mrow></mml:semantics></mml:math></disp-formula> <disp-formula id="bmcM7"><label>(7)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M17" name="1471-2105-9-303-i16" overflow="scroll"><mml:semantics><mml:mrow><mml:mtext>Fdr</mml:mtext><mml:mo stretchy="false">(</mml:mo><mml:mi>y</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mi>η</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mfrac><mml:mrow><mml:mn>1</mml:mn><mml:mo>−</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>y</mml:mi><mml:mo>;</mml:mo><mml:mi>θ</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>−</mml:mo><mml:mi>F</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>y</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac><mml:mo>.</mml:mo></mml:mrow></mml:semantics></mml:math></disp-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M18" name="1471-2105-9-303-i17" overflow="scroll"><mml:semantics><mml:msup><mml:mover accent="true"><mml:mi>F</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mo>′</mml:mo></mml:msup></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M19" name="1471-2105-9-303-i18" overflow="scroll"><mml:semantics><mml:mover accent="true"><mml:mi>F</mml:mi><mml:mo>^</mml:mo></mml:mover></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M20" name="1471-2105-9-303-i17" overflow="scroll"><mml:semantics><mml:msup><mml:mover accent="true"><mml:mi>F</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mo>′</mml:mo></mml:msup></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M21" name="1471-2105-9-303-i18" overflow="scroll"><mml:semantics><mml:mover accent="true"><mml:mi>F</mml:mi><mml:mo>^</mml:mo></mml:mover></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M22" name="1471-2105-9-303-i19" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi>f</mml:mi><mml:mn>0</mml:mn><mml:mi>t</mml:mi></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M23" name="1471-2105-9-303-i19" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi>f</mml:mi><mml:mn>0</mml:mn><mml:mi>t</mml:mi></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M24" name="1471-2105-9-303-i13" overflow="scroll"><mml:semantics><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>η</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M25" name="1471-2105-9-303-i20" overflow="scroll"><mml:semantics><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>η</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mn>0</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mi>max</mml:mi><mml:mo>⁡</mml:mo><mml:mo>{</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>m</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow><mml:mi>m</mml:mi></mml:mfrac><mml:mo>/</mml:mo><mml:mi>F</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>;</mml:mo><mml:mover accent="true"><mml:mi>θ</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mo stretchy="false">)</mml:mo><mml:mo>}</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M26" name="1471-2105-9-303-i21" overflow="scroll"><mml:semantics><mml:mrow><mml:msub><mml:mi>z</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mover accent="true"><mml:mi>μ</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mo>+</mml:mo><mml:mi>b</mml:mi><mml:mover accent="true"><mml:mi>σ</mml:mi><mml:mo>^</mml:mo></mml:mover></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M27" name="1471-2105-9-303-i22" overflow="scroll"><mml:semantics><mml:mover accent="true"><mml:mi>μ</mml:mi><mml:mo>^</mml:mo></mml:mover></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M28" name="1471-2105-9-303-i23" overflow="scroll"><mml:semantics><mml:mover accent="true"><mml:mi>σ</mml:mi><mml:mo>^</mml:mo></mml:mover></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M29" name="1471-2105-9-303-i22" overflow="scroll"><mml:semantics><mml:mover accent="true"><mml:mi>μ</mml:mi><mml:mo>^</mml:mo></mml:mover></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M30" name="1471-2105-9-303-i23" overflow="scroll"><mml:semantics><mml:mover accent="true"><mml:mi>σ</mml:mi><mml:mo>^</mml:mo></mml:mover></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M31" name="1471-2105-9-303-i24" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi>F</mml:mi><mml:mn>0</mml:mn><mml:mrow><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M32" name="1471-2105-9-303-i13" overflow="scroll"><mml:semantics><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>η</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M33" name="1471-2105-9-303-i25" overflow="scroll"><mml:semantics><mml:mover accent="true"><mml:mi>θ</mml:mi><mml:mo>^</mml:mo></mml:mover></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M34" name="1471-2105-9-303-i25" overflow="scroll"><mml:semantics><mml:mover accent="true"><mml:mi>θ</mml:mi><mml:mo>^</mml:mo></mml:mover></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M35" name="1471-2105-9-303-i26" overflow="scroll"><mml:semantics><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>f</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mi>p</mml:mi></mml:msub></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M36" name="1471-2105-9-303-i27" overflow="scroll"><mml:semantics><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>F</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mi>p</mml:mi></mml:msub></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M37" name="1471-2105-9-303-i13" overflow="scroll"><mml:semantics><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>η</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:semantics></mml:math></inline-formula> <disp-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M38" name="1471-2105-9-303-i28" overflow="scroll"><mml:semantics><mml:mrow><mml:mtable><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>fdr</mml:mtext></mml:mrow><mml:mo stretchy="true">^</mml:mo></mml:mover></mml:mrow><mml:mi>p</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>η</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mn>0</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>f</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mi>p</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>Fdr</mml:mtext></mml:mrow><mml:mo stretchy="true">^</mml:mo></mml:mover></mml:mrow><mml:mi>p</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>η</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mn>0</mml:mn></mml:msub><mml:mi>p</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>F</mml:mi><mml:mo>ˆ</mml:mo></mml:mover><mml:mi>p</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:semantics></mml:math></disp-formula> <disp-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M39" name="1471-2105-9-303-i29" overflow="scroll"><mml:semantics><mml:mrow><mml:mtable><mml:mtr><mml:mtd><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>fdr</mml:mtext></mml:mrow><mml:mo stretchy="true">^</mml:mo></mml:mover><mml:mo stretchy="false">(</mml:mo><mml:mi>y</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>fdr</mml:mtext></mml:mrow><mml:mo stretchy="true">^</mml:mo></mml:mover></mml:mrow><mml:mi>p</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo>−</mml:mo><mml:msub><mml:mover accent="true"><mml:mi>F</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mn>0</mml:mn></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>y</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>Fdr</mml:mtext></mml:mrow><mml:mo stretchy="true">^</mml:mo></mml:mover><mml:mo stretchy="false">(</mml:mo><mml:mi>y</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>Fdr</mml:mtext></mml:mrow><mml:mo stretchy="true">^</mml:mo></mml:mover></mml:mrow><mml:mi>p</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo>−</mml:mo><mml:msub><mml:mover accent="true"><mml:mi>F</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mn>0</mml:mn></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>y</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:semantics></mml:math></disp-formula> <disp-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M40" name="1471-2105-9-303-i30" overflow="scroll"><mml:semantics><mml:mrow><mml:mtable><mml:mtr><mml:mtd><mml:mrow><mml:mover accent="true"><mml:mi>f</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mo stretchy="false">(</mml:mo><mml:mi>y</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mover accent="true"><mml:mi>η</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mn>0</mml:mn></mml:msub><mml:mfrac><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>f</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mn>0</mml:mn></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>y</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>fdr</mml:mtext></mml:mrow><mml:mo stretchy="true">^</mml:mo></mml:mover><mml:mo stretchy="false">(</mml:mo><mml:mi>y</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mover accent="true"><mml:mi>F</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mo stretchy="false">(</mml:mo><mml:mi>y</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>−</mml:mo><mml:msub><mml:mover accent="true"><mml:mi>η</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mn>0</mml:mn></mml:msub><mml:mfrac><mml:mrow><mml:mn>1</mml:mn><mml:mo>−</mml:mo><mml:msub><mml:mover accent="true"><mml:mi>F</mml:mi><mml:mo>ˆ</mml:mo></mml:mover><mml:mn>0</mml:mn></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>y</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>Fdr</mml:mtext></mml:mrow><mml:mo stretchy="true">^</mml:mo></mml:mover><mml:mo stretchy="false">(</mml:mo><mml:mi>y</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:semantics></mml:math></disp-formula> <disp-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M41" name="1471-2105-9-303-i31" overflow="scroll"><mml:semantics><mml:mrow><mml:mtable><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>F</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mi>A</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>y</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mover accent="true"><mml:mi>F</mml:mi><mml:mo>ˆ</mml:mo></mml:mover><mml:mo stretchy="false">(</mml:mo><mml:mi>y</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>−</mml:mo><mml:msub><mml:mover accent="true"><mml:mi>η</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mn>0</mml:mn></mml:msub><mml:msub><mml:mover accent="true"><mml:mi>F</mml:mi><mml:mo>ˆ</mml:mo></mml:mover><mml:mn>0</mml:mn></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>y</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>−</mml:mo><mml:msub><mml:mover accent="true"><mml:mi>η</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:mfrac></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>f</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mi>A</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>y</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mover accent="true"><mml:mi>f</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mo stretchy="false">(</mml:mo><mml:mi>y</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>−</mml:mo><mml:msub><mml:mover accent="true"><mml:mi>η</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mn>0</mml:mn></mml:msub><mml:msub><mml:mover accent="true"><mml:mi>f</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mn>0</mml:mn></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>y</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>−</mml:mo><mml:msub><mml:mover accent="true"><mml:mi>η</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:mfrac></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:semantics></mml:math></disp-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M42" name="1471-2105-9-303-i32" overflow="scroll"><mml:semantics><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>A</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>p</mml:mi><mml:mo>;</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mfrac><mml:mi>a</mml:mi><mml:mrow><mml:mi>exp</mml:mi><mml:mo>⁡</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mfrac><mml:mi>exp</mml:mi><mml:mo>⁡</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>a</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo>−</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M43" name="1471-2105-9-303-i23" overflow="scroll"><mml:semantics><mml:mover accent="true"><mml:mi>σ</mml:mi><mml:mo>^</mml:mo></mml:mover></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M44" name="1471-2105-9-303-i13" overflow="scroll"><mml:semantics><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>η</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M45" name="1471-2105-9-303-i23" overflow="scroll"><mml:semantics><mml:mover accent="true"><mml:mi>σ</mml:mi><mml:mo>^</mml:mo></mml:mover></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M46" name="1471-2105-9-303-i13" overflow="scroll"><mml:semantics><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>η</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M47" name="1471-2105-9-303-i13" overflow="scroll"><mml:semantics><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>η</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M48" name="1471-2105-9-303-i23" overflow="scroll"><mml:semantics><mml:mover accent="true"><mml:mi>σ</mml:mi><mml:mo>^</mml:mo></mml:mover></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M49" name="1471-2105-9-303-i23" overflow="scroll"><mml:semantics><mml:mover accent="true"><mml:mi>σ</mml:mi><mml:mo>^</mml:mo></mml:mover></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M50" name="1471-2105-9-303-i13" overflow="scroll"><mml:semantics><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>η</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:semantics></mml:math></inline-formula>
<table-wrap-foot><p>Note that in the above definitions TP, FP, FN, FP are assumed to be the true fractions – see Fig. 1. If instead observed counts are used, additionally the expectation <italic>E</italic>(.) must be taken, conditioned on seeing a non-zero denominator (cf. [##REF##12883005##7##,##UREF##7##11##]).</p></table-wrap-foot> <table-wrap-foot><p>Note: The first column refers to an R package or R script implementing the respective FDR algorithm.</p></table-wrap-foot> <table-wrap-foot><p>Note that  and  are robust location and scale estimates, respectively.</p></table-wrap-foot>
<graphic xlink:href="1471-2105-9-303-1"/> <graphic xlink:href="1471-2105-9-303-2"/> <graphic xlink:href="1471-2105-9-303-3"/> <graphic xlink:href="1471-2105-9-303-4"/> <graphic xlink:href="1471-2105-9-303-5"/> <graphic xlink:href="1471-2105-9-303-6"/> <graphic xlink:href="1471-2105-9-303-7"/>
[{"surname": ["Schweder", "Spj\u00f8tvoll"], "given-names": ["T", "E"], "article-title": ["Plots of "], "italic": ["p"], "source": ["Biometrika"], "year": ["1982"], "volume": ["69"], "fpage": ["493"], "lpage": ["502"]}, {"surname": ["Benjamini", "Hochberg"], "given-names": ["Y", "Y"], "article-title": ["Controlling the false discovery rate: a practical and powerful approach to multiple testing"], "source": ["J R Statist Soc B"], "year": ["1995"], "volume": ["57"], "fpage": ["289"], "lpage": ["300"]}, {"surname": ["Efron"], "given-names": ["B"], "article-title": ["Large-scale simultaneous hypothesis testing: the choice of a null hypothesis"], "source": ["J Amer Statist Assoc"], "year": ["2004"], "volume": ["99"], "fpage": ["96"], "lpage": ["104"], "pub-id": ["10.1198/016214504000000089"]}, {"surname": ["Langaas", "Lindqvist", "Ferkingstad"], "given-names": ["M", "BH", "E"], "article-title": ["Estimating the proportion of true null hypotheses, with application to DNA microarray data"], "source": ["J R Statist Soc B"], "year": ["2005"], "volume": ["67"], "fpage": ["565"], "lpage": ["572"], "pub-id": ["10.1111/j.1467-9868.2005.00515.x"]}, {"surname": ["Efron"], "given-names": ["B"], "article-title": ["Microarrays, empirical Bayes, and the two-groups model"], "source": ["Statistical Science"], "year": ["2008"], "volume": ["23"], "comment": ["to appear."]}, {"surname": ["Genovese", "Wassermann"], "given-names": ["C", "L"], "article-title": ["Operating characteristics and extensions of the false discovery rate procedure"], "source": ["J R Statist Soc B"], "year": ["2002"], "volume": ["64"], "fpage": ["499"], "lpage": ["517"], "pub-id": ["10.1111/1467-9868.00347"]}, {"surname": ["Bonferroni"], "given-names": ["CE"], "article-title": ["Il calcolo delle assicurazioni su gruppi di teste"], "source": ["Studi in Onore del Professore Salvatore Ortu Carboni, Rome"], "year": ["1935"], "fpage": ["13"], "lpage": ["60"]}, {"surname": ["Storey"], "given-names": ["JD"], "article-title": ["The positive false discovery rate: A Bayesian interpretation and the q-value"], "source": ["Ann Statist"], "year": ["2003"], "volume": ["31"], "fpage": ["2013"], "lpage": ["2035"], "pub-id": ["10.1214/aos/1074290335"]}, {"surname": ["Storey"], "given-names": ["JD"], "article-title": ["A direct approach to false discovery rates"], "source": ["J R Statist Soc B"], "year": ["2002"], "volume": ["64"], "fpage": ["479"], "lpage": ["498"], "pub-id": ["10.1111/1467-9868.00346"]}, {"surname": ["Efron", "Tibshirani", "Storey", "Tusher"], "given-names": ["B", "R", "JD", "V"], "article-title": ["Empirical Bayes analysis of a microarray experiment"], "source": ["J Amer Statist Assoc"], "year": ["2001"], "volume": ["96"], "fpage": ["1151"], "lpage": ["1160"], "pub-id": ["10.1198/016214501753382129"]}, {"surname": ["Efron"], "given-names": ["B"], "article-title": ["Robbins, empirical Bayes, and microarrays"], "source": ["Annals of Statistics"], "year": ["2003"], "volume": ["31"], "fpage": ["366"], "lpage": ["378"], "pub-id": ["10.1214/aos/1051027871"]}, {"surname": ["Efron"], "given-names": ["B"], "article-title": ["Correlation and large-scale simultaneous significance tesing"], "source": ["J Amer Statist Assoc"], "year": ["2007"], "volume": ["102"], "fpage": ["93"], "lpage": ["103"], "pub-id": ["10.1198/016214506000001211"]}, {"surname": ["Sun", "Cai"], "given-names": ["W", "TT"], "article-title": ["Oracle and adaptive compound decision rules for false discovery control"], "source": ["J Amer Statist Assoc"], "year": ["2007"], "volume": ["102"], "fpage": ["901"], "lpage": ["912"], "pub-id": ["10.1198/016214507000000545"]}, {"collab": ["R Development Core Team"], "source": ["R: A language and environment for statistical computing"], "year": ["2007"], "publisher-name": ["R Foundation for Statistical Computing, Vienna, Austria"], "comment": ["[ISBN 3-900051-07-0]."]}, {"surname": ["Strimmer"], "given-names": ["K"], "article-title": ["fdrtool: a versatile R package for estimating local and tail area-based false discovery rates"], "source": ["Bionformatics"], "year": ["2008"], "volume": ["24"], "fpage": ["1461"], "lpage": ["1462"], "pub-id": ["10.1093/bioinformatics/btn209"]}, {"surname": ["Efron", "Tibshirani"], "given-names": ["B", "R"], "article-title": ["Using specially designed exponential families for density estimation"], "source": ["Ann Statist"], "year": ["1998"], "volume": ["24"], "fpage": ["2431"], "lpage": ["2461"]}, {"surname": ["Robin", "Bar-Hen", "Daudin", "Pierre"], "given-names": ["S", "A", "JJ", "L"], "article-title": ["A semi-parametric approach for mixture models: application to local false discovery rate estimation"], "source": ["Comput Statist Data Analysis"], "year": ["2007"], "volume": ["51"], "fpage": ["5483"], "lpage": ["5493"], "pub-id": ["10.1016/j.csda.2007.02.028"]}, {"surname": ["Guan", "Wu", "Zhao"], "given-names": ["Z", "B", "H"], "article-title": ["Nonparametric estimator of false discovery rate based on Bernstein polynomials"], "source": ["Statistica Sinica"], "year": ["2008"]}, {"surname": ["Grenander"], "given-names": ["U"], "article-title": ["On the theory of mortality measurement, Part II"], "source": ["Skan Aktuarietidskr"], "year": ["1956"], "volume": ["39"], "fpage": ["125"], "lpage": ["153"]}, {"surname": ["Robertson", "Wright", "Dykstra"], "given-names": ["T", "FT", "RL"], "source": ["Order restricted statistical inference"], "year": ["1988"], "publisher-name": ["John Wiley and Sons"]}, {"surname": ["Turnbull"], "given-names": ["BB"], "article-title": ["Optimal estimation of false discovery rates"], "source": ["Tech rep"], "year": ["2007"], "publisher-name": ["Stanford University"]}, {"surname": ["Efron"], "given-names": ["B"], "article-title": ["Size, power and false discovery rates"], "source": ["Ann Statist"], "year": ["2007"], "volume": ["35"], "fpage": ["1351"], "lpage": ["1377"], "pub-id": ["10.1214/009053606000001460"]}, {"surname": ["Scheid", "Spang"], "given-names": ["S", "R"], "article-title": ["A stochastic downhill search algorithm for estimating the local false disovery rate"], "source": ["IEEE T Comp Biol Bioinf"], "year": ["2004"], "volume": ["1"], "fpage": ["98"], "lpage": ["108"], "pub-id": ["10.1109/TCBB.2004.24"]}, {"surname": ["Jin", "Cai"], "given-names": ["J", "TT"], "article-title": ["Estimating the null and the proportion of nonnull effects in large-scale multiple comparisons"], "source": ["J Amer Statist Assoc"], "year": ["2007"], "volume": ["102"], "fpage": ["495"], "lpage": ["506"], "pub-id": ["10.1198/016214507000000167"]}]
BMC Bioinformatics. 2008 Jul 9; 9:303