论文信息 - A remark on algorithm 643: FEXACT: an algorithm for performing Fisher's exact test in r x c contingency tables

A remark on algorithm 643: FEXACT: an algorithm for performing Fisher's exact test in r x c contingency tables

The network algorithm of Mehta and Patel [1986] is currently the best general algorithm for computing exact probabilities in r × c contingency tables with fixed marginals. Given here are some improvements to the network algorithm which speed its computational performance; and thus increases the size of problems which can be handled. The new code also eliminates some programming restrictions in the old code, implements the «hybrid» algorithm of Mehta and Patel [1986a], and demonstrates that the exact path length bounds of Joe [1988] should always be used in place of the approximate bounds of Mehta and Patel [1986]. The new code can be much faster than the old code in some problems

[1] Nitin R. Patel,et al. ALGORITHM 643: FEXACT: a FORTRAN subroutine for Fisher's exact test on unordered r×c contingency tables , 1986, TOMS.

[2] Cyrus R. Mehta,et al. A network algorithm for the exact treatment of the 2×k contingency table , 1980 .

[3] W. G. Cochran. Some Methods for Strengthening the Common χ 2 Tests , 1954 .

[4] H. Joe. An ordering of dependence for contingency tables , 1985 .

[5] Cyrus R. Mehta,et al. A hybrid algorithm for fisher's exact test in unordered rxc contingency tables , 1986 .

[6] Harry Joe,et al. Extreme probabilities for contingency tables under row and column independence with application to fisher's exact test , 1988 .

[7] F. Yates,et al. Tests of Significance for 2 × 2 Contingency Tables , 1984 .

[8] Nitin R. Patel,et al. A Network Algorithm for Performing Fisher's Exact Test in r × c Contingency Tables , 1983 .