{'fraction_non_alphanumeric': 0.015180265654648957, 'fraction_numerical': 0.007590132827324478, 'mean_word_length': 5.719745222929936, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Multistage and Mixture Parallel Gatekeeping Procedures in Clinical Trials

Gatekeeping procedures have been developed to solve multiplicity problems arising in clinical trials with hierarchical objectives where the null hypotheses that address these objectives are grouped into ordered families. A general method for constructing multistage parallel gatekeeping procedures was proposed by Dmitrienko et al. (2008). The objective of this paper is to study two related classes of parallel gatekeeping procedures. Restricting to two-family hypothesis testing problems, we first use the mixture method developed in Dmitrienko and Tamhane (2011) to define a class of parallel gatekeeping procedures derived using the closure principle that can be more powerful than multistage gatekeeping procedures. Second, we show that power of multistage gatekeeping procedures can also be improved by using α-exhaustive tests for the component procedures. Extensions of these results for multiple families are stated. Illustrative examples from clinical trials are given.