Cyrus R. Mehta
Abstract
The computer code for Mehta and Patel's (1983) network algorithm for Fisher's exact test on unordered r×c contingency tables is provided. The code is written in double precision FORTRAN 77. This code provides the fastest currently available method for executing Fisher's exact test, and is shown to be orders of magnitude superior to any other available algorithm. Many important details of data structures and implementation that have contributed crucially to the success of the network algorithm are recorded here.
Supplemental Material
Available for Download
Fisher's exact test on unordered r-by-c contingency tables Gams: L9b
- 1 BAKER, R.J. Exact distributions derived from two-way tables. J. Royal Stat. Soc. Series C, 26, 2 (1977), 199.-206.Google Scholar
- 2 GAIL, M., AND MANTEL, N. Counting the number of contingency tables with fixed margins. J. Am. Stat. Assoc. 72 (1977), 859-862.Google Scholar
- 3 HANCOCK, T.W. Remark on algorithm 434 {G2}. Exact probabilties for rxc contingency tables. Commun. ACM 18, 2 (Feb. 1975), 117-119.Google Scholar
- 4 KNUTH, D.E. The Art of Computer Programming. Vol. 3: Sorting and Searching. Addison- Wesley, Reading, Mass, 1973. Google Scholar
- 5 MARCH, D. L. Exact probabilities for rXc contingency tables. Commun. ACM 15, 11 (Nov. 1972), 991-992. Google Scholar
- 6 MEHTA, C. R., AND PATEL, N.R. A network algorithm for the exact treatment of the 2xk contingency table. Commun. Stat. B9, 6 (1980), 649-664.Google Scholar
- 7 MEHTA, C. R., AND PATEL, N.R. A network algorithm for performing Fisher's exact test in rxc contingency tables. J. Am. Stat. Assoc. 78, 382 (1983), 427-434.Google Scholar
- 8 MEHTA, C. R., PATEL, N. R., AND TSIATIS, A. A. Exact significance testing to establish treatment equivalence with ordered categorical data. Biometrics 40, 3 (1984), 819-825.Google Scholar
- 9 MEHTA, C. R., PATEL, N. R., AND GRAY, R. On computing an exact confidence interval for the common odds ratio in several 2x2 contingency tables. J. Am. Stat. Assoc. 80, 392 (1985), 969-973.Google Scholar
- 10 PAGANO, M., AND HALVORSEN, K. An algorithm for finding the exact significance levels of rXc contingency tables. J. Am. Stat. Assoc. 76 (1981), 931-934.Google Scholar
- 11 VERBEEK, A., AND KROONENBERG, P. A survey of algorithms for exact distributions of test statistics in rxc contingency tables with fixed margins. Comput. Star. Data Anal. 3 (1985), 159-185.Google Scholar
Index Terms
- ALGORITHM 643: FEXACT: a FORTRAN subroutine for Fisher's exact test on unordered r×c contingency tables
Recommendations
Optimal Insertion of Software Probes in Well-Delimited Programs
A standard technique for monitoring software testing activities is to instrument the module under test with counters or probes before testing begins; then, during testing, data generated by these probes can be used to identify portions of as yet ...
A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids
In the minimum-degree minimum spanning tree (MDMST) problem, we are given a graph G, and the goal is to find a minimum spanning tree (MST) T, such that the maximum degree of T is as small as possible. This problem is NP-hard and generalizes the ...
Low-Degree Spanning Trees of Small Weight
Given $n$ points in the plane, the degree-$K$ spanning-tree problem asks for a spanning tree of minimum weight in which the degree of each vertex is at most $K$. This paper addresses the problem of computing low-weight degree-$K$ spanning trees for $K>2$...
Comments