Related Experiment Video
Updated: May 5, 2026

Plasmid-derived DNA Strand Displacement Gates for Implementing Chemical Reaction Networks
Published on: November 25, 2015
A general multistage procedure for k-out-of-n gatekeeping
1IIS Statistical Methodology, Novartis Pharmaceuticals Corporation, One Health Plaza, East Hanover, NJ 07936, U.S.A.
Insights
This study introduces k-out-of-n gatekeeping, a flexible statistical method for clinical trials. It allows testing subsequent hypotheses if at least k of n initial hypotheses are rejected, improving efficiency in complex trial designs.
Area of Science:
- Biostatistics
- Clinical Trial Design
- Statistical Inference
Background:
- Traditional gatekeeping procedures often follow parallel (k=1) or serial (k=n) testing rules.
- Complex clinical trial designs, such as those in rheumatoid arthritis, require more nuanced hypothesis testing strategies.
- Existing methods may lack flexibility or be cumbersome to implement for multi-endpoint evaluations.
Purpose of the Study:
- To generalize multistage gatekeeping procedures to a k-out-of-n framework.
- To develop a unified theory for k-out-of-n gatekeeping applicable to arbitrary k values.
- To provide a simpler and more efficient stepwise algorithm for hypothesis testing in clinical trials.
Main Methods:
- Generalization of parallel gatekeeping to k-out-of-n hypothesis testing.
- Development of a unified theory for multistage procedures using the closure method.
- Derivation of explicit formulas for adjusted p-value calculation.
Main Results:
- The k-out-of-n gatekeeping framework unifies parallel and serial gatekeeping.
- A novel stepwise algorithm is proposed, offering a simpler application compared to existing mixture or graphical procedures.
- The closure method facilitates the construction of truncated separable multistage procedures.
Conclusions:
- The k-out-of-n gatekeeping procedure offers a versatile and practical approach for complex clinical trial hypothesis testing.
- The proposed stepwise algorithm simplifies the application of multistage testing, enhancing usability.
- This generalization provides a more robust framework for statistical inference in multi-endpoint studies.
Abstract:
We generalize a multistage procedure for parallel gatekeeping to what we refer to as k-out-of-n gatekeeping in which at least k out of n hypotheses ( 1 ⩽ k ⩽ n) in a gatekeeper family must be rejected in order to test the hypotheses in the following family. This gatekeeping restriction arises in certain types of clinical trials; for example, in rheumatoid arthritis trials, it is required that efficacy be shown on at least three of the four primary endpoints. We provide a unified theory of multistage procedures for arbitrary k, with k = 1 corresponding to parallel gatekeeping and k = n to serial gatekeeping. The theory provides an insight into the construction of truncated separable multistage procedures using the closure method. Explicit formulae for calculating the adjusted p-values are given. The proposed procedure is simpler to apply for this particular problem using a stepwise algorithm than the mixture procedure and the graphical procedure with memory using entangled graphs.
Related Concept Videos
Randomized Experiments
Simple randomization
Simple...
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation
On...
Quantifying and Rejecting Outliers: The Grubbs Test
Combinatorial Gene Control
The expression of more than 30,000 genes is controlled by approximately 2000-3000 transcription factors. This is possible because a single transcription factor can recognize more than one regulatory sequence. The specificity in gene...
Woodward–Hoffmann Selection Rules and Microscopic Reversibility
Methods of Medium Optimization

