ALGORITHM 643
C R Mehta, Nitin R. Patel · ACM Transactions on Mathematical Software · 1986
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.
Cited by 203 works. doi:10.1145/6497.214326 Open-access PDF
Authors
References
- The Art of Computer Programming
- A Network Algorithm for Performing Fisher's Exact Test in r × c Contingency Tables
- Exact Significance Testing to Establish Treatment Equivalence with Ordered Categorical Data
- Computing an Exact Confidence Interval for the Common Odds Ratio in Several 2×2 Contingency Tables
- A Network Algorithm for Performing Fisher's Exact Test in r × c Contingency Tables
- An Algorithm for Finding the Exact Significance Levels of r × c Contingency Tables
- Counting the Number ofr×cContingency Tables with Fixed Margins
- An Algorithm for Finding the Exact Significance Levels of r × c Contingency Tables
- A network algorithm for the exact treatment of the 2×k contingency table
- Nonparametric Estimation for a Scale-Change with Censored Observations