A note on exact analysis of several 2x2 tables

被引：4
|
作者：
Hirji, KF
机构：
[1] Department of Biomathematics, UCLA School of Medicine, Los Angeles
来源：
BIOMETRICS | 1996年 / 52卷 / 03期
关键词：
fast Fourier transform; network algorithm; polynomial multiplication algorithm;
D O I：
10.2307/2533062
中图分类号：
Q [生物科学];
学科分类号：
07 ; 0710 ; 09 ;
摘要：
Yao and Tritchler (1993, Biometrics 49, 233-236) proposed an exact test for conditional independence in a series of 2 x 2 tables, and presented a fast Fourier transform (FFT) algorithm to compute exact significance levels for it. The purpose of this note is to provide a general perspective on computational methods applicable to this problem. We also assess the power and efficiency comparisons done by them.
引用
收藏
页码：1018 / 1025
页数：8
相关论文
共 50 条
12345