A Shift Algorithm for Exact Computation in Sequential Tests with Binary Outcome

✍ Scribed by Josef Högel

• Publisher: John Wiley and Sons
• Year: 2000
• Tongue: English
• Weight: 83 KB
• Volume: 42
• Category: Article
• ISSN: 0323-3847
• DOI: 10.1002/(sici)1521-4036(200005)42:2<189::aid-bimj189>3.0.co;2-m

✦ Synopsis

A simple shift algorithm is described enabling the exact determination of power functions and sample size distributions for a large variety of closed sequential two-sample designs with a binary outcome variable. The test statistics are assumed to be based on relative frequencies of successes or failures, but the number of interim analyses, the monitoring times, and the continuation regions may be specified as desired. To give examples, exact properties of designs proposed by the program package EaSt (CYTEL, 1992) are determined, and plans with interim analyses are considered where decisions are based on the conditional power given the observations obtained so far.