betaFeedback

WorksMathematics

Exact association-test distributions for prior-informed stepwise SNP prioritization

Abstract

Prioritizing causal variants in Genome-Wide Association Studies (GWAS) is challenging due to linkage disequilibrium and high dimensionality. We propose an iterative algorithm for the selection of genetic variables that allows the integration of biological priors. The proposed algorithm requires the specification of the power function of a test statistic and incorporates a priori information on each SNP. We derive the approximate and exact distributions of several commonly used test statistics. At each step of the proposed algorithm, we select the SNP with the largest a posteriori probability of being causal. We consider several stopping criteria for the algorithm. We conduct comprehensive simulation studies to assess the performance of several versions of the proposed algorithm and to make a comparison to some existing competitors. The use of the proposed prioritization algorithm is illustrated with a cis-eQTL application to a human gene-expression data, using European discovery and Yoruba cross-population replication.

Introduction

Genome-wide association studies (GWAS) have identified thousands of loci associated with complex traits and diseases, but the lead SNP at an associated locus is rarely guaranteed to be causal. Linkage disequilibrium (LD) distributes the association signal across correlated markers, so a detected SNP may be a tag variant, a proxy for an untyped causal allele, or a false positive (Gögele et al., 2012; Hormozdiari et al., 2014, 2015; Schaid et al., 2018; Hautakangas et al., 2024; Wu et al., 2024; Long et al., 2025). This creates a methodological gap between association discovery and biological interpretation. GWAS points to regions, whereas downstream experimental and translational work requires a much shorter list of plausible causal variants.

Statistical fine-mapping addresses this gap by modeling multiple candidate variants and reporting variant-level measures of support, usually through Bayesian posterior inclusion probabilities (PIPs) or credible sets (Guan and Stephens, 2011; Wen, 2014; Stephens and Balding, 2009; The Wellcome Trust Case Control Consortium et al., 2012; Wang et al., 2020; Li et al., 2024). Modern fine-mapping tools, including CAVIAR (Hormozdiari et al., 2014), FINEMAP (Benner et al., 2016), SuSiE (Wang et al., 2020) and CARMA [3], have greatly improved locus-level resolution and scalability. Other Bayesian regression and shrinkage approaches, such as varbvs (Carbonetto and Stephens, 2012), provide complementary strategies for high-dimensional genotype data [5] (Logsdon et al. 2010; Habier et al. 2011; Ge et al. 2019; Song et al. 2022). Functional annotations can further improve prioritization when they are relevant to the trait and tissue, as shown in annotation-informed fine-mapping and post-GWAS integration studies (Kichaev et al., 2014; Pickrell, 2014; Roadmap Epigenomics Consortium et al., 2015; Chen et al., 2016; Karimnezhad and Bickel, 2020; He et al., 2022).

Prior-informed ranking of candidate variants arises in at least three practical settings. First, follow-up resources are limited. A study carries a fixed budget of KK variants forward to functional validation or targeted genotyping, so the operational question within an associated region is which variants to pursue first. Ordering hypotheses by external information is the rationale of weighted hypothesis testing (Genovese et al., 2006; Roeder and Wasserman, 2009) and of functionally informed re-weighting such as FINDOR (Kichaev et al., 2019). Second, conditional stepwise scans are standard practice for separating signals within an associated region, with each candidate scored given the currently selected set [2]. The framework developed here equips this conditional path with finite-sample calibration and explicit prior weights. Finally, combining association evidence with functional annotation is central to fine-mapping follow-up, including expression quantitative trait locus (eQTL) studies in which each gene defines a natural candidate window. These settings share the same underlying problem, namely ranking candidates under a limited follow-up budget while incorporating potentially imperfect prior information, often at sample sizes for which asymptotic calibration may be unreliable.

Two statistical issues remain especially important for stepwise or screening-oriented procedures. First, many association statistics are approximated by standard normal or chi-square distributions, implicitly ignoring the variability of the estimated residual variance. This is convenient, but it can miscalibrate evidence when the model is refit many times along an expanding selected set [4, 6] (Banerjee et al. 2018). Second, biological priors are not uniformly reliable. A high-quality annotation sharpens the ranking, but a misspecified prior actively pushes a method toward the wrong part of the genome, acutely so for joint selection rules that amplify prior information rather than merely using it as a weak tie-breaker.

We propose a prior-informed stepwise SNP-prioritization framework that directly targets these two issues. At each step, the method evaluates candidate SNPs through a local posterior score obtained by combining a SNP-level annotation weight with the finite-sample distribution of a Wald, Score or joint multiple-SNP statistic. The score is path-conditional and local. It is a greedy evidence score designed for computationally light prioritization. Exact non-central tt and FF distributions are used when available, and are compared with naive and first-order asymptotic approximations.

This framework sits at the intersection of several literatures, but its objective differs from each. Annotation-informed fine-mapping targets model-averaged inclusion probabilities within a locus, whereas our procedure produces path-conditional scores along a single greedy path. Classical forward selection carries no prior weight and relies on nominal normal or chi-square distributions. Bayesian variable selection and penalized regression fit a full joint model over the variants. Selective-inference methods target valid post-selection intervals rather than ranking. And weighted multiple-testing procedures re-weight marginal pp-values once (Genovese et al., 2006; Kichaev et al., 2019), whereas our scores are recomputed conditionally along the path, so the prior informs every conditional decision rather than only the initial screen. The method thus complements locus-level fine-mapping tools and full Bayesian model averaging as a prior-sensitive stepwise prioritization procedure.

The paper makes five contributions, the first two of which are primarily theoretical. First, we derive the exact and approximate finite-sample distributions of the single-SNP Wald and Score statistics, and of the joint Multiple-SNP statistic, in the path-conditional stepwise setting in which each candidate is scored given the currently selected set. These distributions explicitly account for the variability of the residual-variance estimate that the usual normal and chi-square approximations treat as fixed, and are summarized in Table 1. Second, we show how these distributions embed into a prior-weighted local posterior score for greedy prioritization, whose prior integrals are computed exactly. Because they calibrate candidate statistics conditional on a fixed selected set, the same distributions can be reused outside this Bayesian score, for instance in classical forward selection or conditional screening. Third, we quantify the practical payoff of this finite-sample calibration. It is substantial for the single-variant Wald statistic at small sample sizes, where the normal approximations are weak, and negligible for the joint statistic. Fourth, we show through the broader simulations that, once the sample is large, prior quality rather than the choice of statistic becomes the main determinant of joint-method performance. A faithful prior is decisive, and a misspecified prior is actively harmful. Fifth, we compare fixed-KK and adaptive stopping rules (adjusted R2R^2, BIC, eBIC and posterior-score thresholds) and assess the framework against some standard methods. The methodology is evaluated at three levels. The first is a set of simulations based on real and on parametrically controlled LD structures, including the small-sample regime where the exact distributions depart from their asymptotic approximations. The second is a semi-synthetic evaluation built on real human genotypes from the Genetic European Variation in Health and Disease (GEUVADIS) study ((Lappalainen et al., 2013; 1000 Genomes Project Consortium, 2015)), with known simulated truths and PolyFun-derived functional prior weights ((Weissbrod et al., 2020)). The third is a real cis-eQTL fine-mapping application to GEUVADIS gene expression, with priors spanning a gradient of biological relevance, from discordant to proximity to the transcription start site (TSS), and a cross-population replication.

StatisticStepDistribution under λ\lambdaMethod
Marginal Waldk=1k=1Non-central tn−2(nλj)t_{n-2}(\sqrt{n}\lambda_j)ExW
Marginal Scorek=1k=1One-to-one map to the marginal Wald statisticAsS
Conditional Waldk≥2k\ge2Non-central tn−k−1(λjkn(1−ρjk))t_{n-k-1}(\lambda_{jk}\sqrt{n(1-\rho_{jk})})ExW
Conditional Scorek≥2k\ge2Asymptotic normal with residual-variance correctionAsS
Multiple-SNPk≥2k\ge2Non-central Fk,n−k−1(δ~jk)F_{k,n-k-1}(\tilde{\delta}_{jk}) (exact prior-integrated score)ExM / NaM

Table 1. Test-statistic distributions used in the stepwise score.

The remainder of the paper presents the stepwise algorithm, the test-statistic distributions and the stopping rules in § 2, the simulation evidence, with complete numerical grids in the Supplement (§ 3), the GEUVADIS cis-eQTL application in § 4, and practical use, limitations and extensions in § 5.

Materials and methods

Data structure and variables

In genome-wide association studies (GWAS), millions of genetic variants are measured for a large number of individuals to detect genomic regions associated with a human characteristic or disease. Single nucleotide polymorphisms (SNPs) are probably the most common type of genetic variant. In our study, we consider nn independent individuals and for individual ii, i=1,…,ni=1,\ldots,n, we observe a set of mm SNPs {Gi1,…,Gim}\{G_{i1},\ldots,G_{im}\} and a quantitative phenotype YiY_i. We assume that n≪mn \ll m, i.e., the number of SNPs is considerably larger than the sample size. Furthermore, we assume that there exist mm latent standardized effect sizes λj\lambda_j, j=1,…,mj=1,\ldots,m, such that λj=0\lambda_j=0 indicates that SNP jj contributes to the phenotype, whereas λj=0\lambda_j=0 corresponds to a null effect. Following the Bayesian variable-selection literature ((Logsdon et al., 2010; Guan and Stephens, 2011; Habier et al., 2011), we assume a spike-and-slab prior

λj∼(1−pj)δ0+pjN(0,τj2),\lambda_j \sim(1-p_j)\delta_0 + p_j \mathcal{N}(0,\tau_j^2),

where δ0\delta_0 denotes a point mass at zero, pj∈[0,1]p_j \in[0,1] is the prior inclusion probability for SNP jj, and τj2>0\tau_j^2 > 0 controls the prior variance of non-null effects. In other words,

P(λj≠0)=pj,P(λj=0)=1−pj,andλj∣λj≠0∼N(0,τj2).P(\lambda_j \ne0)=p_j,\qquad P(\lambda_j=0)=1-p_j,\qquad\text{and}\qquad\lambda_j\mid\lambda_j\ne0\sim\mathcal{N}(0,\tau_j^2).

In practice, pjp_j may incorporate biological annotation information, previous GWAS evidence, functional scores, or expert knowledge. The hyperparameters {(pj,τj2)}j=1,…,m\{(p_j,\tau_j^2)\}_{j=1,\ldots,m} are assumed to be known. Within the stepwise procedure developed below, pjp_j is a local annotation weight entering the candidate-level Bayes score at each step, rather than a genome-wide sparse prior. A value such as pj=0.5p_j=0.5 or 0.70.7 encodes the relative annotation strength of SNP jj at the point where it is scored, and does not imply the mpˉm\bar{p} expected causal variants that the same value would carry as a global marginal inclusion probability across all mm SNPs. The SNPs data Gij∈{0,1,2}G_{ij}\in\{0,1,2\}, i=1,…,ni=1,\ldots,n, j=1,…,mj=1,\ldots,m, are counts of minor alleles for SNP jj and individual ii. For ease of computation and without loss of generality, we scale these counts into

Xij=Gij−GˉjSGj2,X_{ij}=\frac{G_{ij}-\bar{G}_j}{\sqrt{S_{G_j}^2}},

where

Gˉj=1n∑i=1nGij\bar{G}_j=\frac{1}{n}\sum_{i=1}^{n}G_{ij}

and

SGj2=1n∑i=1n(Gij−Gˉj)2.S_{G_j}^2=\frac{1}{n}\sum_{i=1}^{n}(G_{ij}-\bar{G}_j)^2.

Thus, we have ∑i=1nXij=0\sum_{i=1}^{n}X_{ij}=0 and ∑i=1nXij2=n\sum_{i=1}^{n}X_{ij}^2=n.

Therefore, the data at hand is (Y,X)(Y,X), where Y=(Y1,…,Yn)⊤Y=(Y_1,\ldots,Y_n)^\top is the vector of phenotypes, A⊤A^\top denotes the transpose of AA and XX is a n×mn\times m matrix of scaled SNPs. Given the data and hyperparameters {(pj,τj2),j=1,…,m}\{(p_j,\tau_j^2),j=1,\ldots,m\}, we aim to select a set of causal SNPs that are associated with the phenotype. To this end, we develop an iterative algorithm and present, assess and compare several variants of the proposed procedure. The main contribution of this work is to propose, implement, assess, and apply an iterative algorithm dedicated to this task.

SNP selection procedure

The selection procedure consists of successive steps. At each step, we select the highest-scoring candidate SNP. The algorithm stops after KK steps, where KK can be a predetermined number or selected by a stopping criterion. For k=0,1,…,Kk=0,1,\ldots,K, we denote by SkS_k the set of the indices of the SNPs already selected at the end of step kk and we let Tk={1,…,m}∖SkT_k=\{1,\ldots,m\}\setminus S_k. Note that TkT_k is composed of the indices of the SNPs still to be examined after step kk. Therefore, one has S0=∅S_0=\varnothing, T0={1,…,m}T_0=\{1,\ldots,m\}, Card⁡(Sk)=k\operatorname{Card}(S_k)=k, and Card⁡(Tk)=m−k\operatorname{Card}(T_k)=m-k. The outcome of the iterative algorithm is SKS_K.

Iterative algorithm

At step k=1k=1, for j∈T0j\in T_0, we consider the following linear model

Y=anβ0j1+X∗jβ1j1+εj1,(1)Y=a_n\beta_{0j1}+X_{\ast j}\beta_{1j1}+\varepsilon_{j1}, \tag*{(1)}

where an=(1,1,…,1)Ta_n=(1,1,\ldots,1)^{\mathsf{T}}, X∗jX_{\ast j} is the jthj^{\mathrm{th}} column of XX, β0j1\beta_{0j1} the intercept, β1j1\beta_{1j1} the regression coefficient for SNP jj, εj1=(ε1j1,ε2j1,…,εnj1)T∼N(0,σj12In)\varepsilon_{j1}=(\varepsilon_{1j1},\varepsilon_{2j1},\ldots,\varepsilon_{nj1})^{\mathsf{T}}\sim N(0,\sigma_{j1}^{2}I_n) the vector of error terms and InI_n the nn by nn identity matrix. We are interested in testing the null hypothesis H0(j1):β1j1=0H_0^{(j1)}:\beta_{1j1}=0.

References

  1. [2]Yang, J., Ferreira, T., Morris, A. P., Medland, S. E., Madden, P. A. F., Heath, A. C., Martin, N. G., Montgomery, G. W., Weedon, M. N., Loos, R. J., Frayling, T. M., McCarthy, M. I., Hirschhorn, J. N., Goddard, M. E., and Visscher, P. M. (2012). Conditional and joint multiple-SNP analysis of GWAS summary statistics identifies additional variants influencing complex traits. Nature Genetics, 44(4):369–375.DOI
  2. [3]Yang, Z., Wang, C., Liu, L., Khan, A., Lee, A., Vardarajan, B., Mayeux, R., Kiryluk, K., and Ionita-Laza, I. (2023). CARMA is a new Bayesian model for fine-mapping in genome-wide association meta-analyses. Nature Genetics, 55(6):1057–1065.DOI
  3. [4]Zeng, P. and Zhou, X. (2017). Non-parametric genetic prediction of complex traits with latent Dirichlet process regression models. Nature Communications, 8(1):456.DOI
  4. [5]Zhou, X., Carbonetto, P., and Stephens, M. (2013). Polygenic Modeling with Bayesian Sparse Linear Mixed Models. PLOS Genetics, 9(2):e1003264.DOI
  5. [6]Zhu, X. and Stephens, M. (2017). BAYESIAN LARGE-SCALE MULTIPLE REGRESSION WITH SUMMARY STATISTICS FROM GENOME-WIDE ASSOCIATION STUDIES. The annals of applied statistics, 11(3):1561–1592.pubmed.ncbi.nlm.nih.gov/29399241

Paper details

vlnc:W_vj2fmtv3
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC0-1.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents