ALGORITHM 643
- 1 June 1986
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 12 (2), 154-161
- https://doi.org/10.1145/6497.214326
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.Keywords
This publication has 5 references indexed in Scilit:
- A survey of algorithms for exact distributions of test statistics in r × c contingency tables with fixed marginsComputational Statistics & Data Analysis, 1985
- Exact Significance Testing to Establish Treatment Equivalence with Ordered Categorical DataBiometrics, 1984
- A network algorithm for the exact treatment of the 2×k contingency tableCommunications in Statistics - Simulation and Computation, 1980
- Algorithm 434: exact probabilities for R×C contingency tables [G2]Communications of the ACM, 1972