ALGORITHM 643: FEXACT: a FORTRAN subroutine for Fisher's exact test on unordered r×c contingency tables

Authors:
Cyrus R. Mehta;Nitin R. Patel
Affiliations:
Harvard Univ., Boston, MA;Indian Institute of Management
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
1986

Citing 2
Cited 5

The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Algorithm 434: exact probabilities for R×C contingency tables [G2]

Communications of the ACM

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

ACM Transactions on Mathematical Software (TOMS)
Extracting the lowest-frequency words: pitfalls and possibilities

Computational Linguistics
An exploratory study of why organizations do not adopt CMMI

Journal of Systems and Software
Overcoming the First Hurdle: Why Organizations Do Not Adopt CMMI

ICSP '09 Proceedings of the International Conference on Software Process: Trustworthy Software Development Processes
A major improvement to the Network Algorithm for Fisher's Exact Test in 2×c contingency tables

Computational Statistics & Data Analysis

Quantified Score

Hi-index	0.00

Visualization

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.