@article { ISI:A1993MR97000006,
	title = {A remark on algorithm-643 - FEXACT - An algorithm for performing fishers exact test in r x c contingency-tables},
	journal = {ACM Transactions on Mathematical Software},
	volume = {19},
	number = {4},
	year = {1993},
	month = {DEC},
	pages = {484-488},
	abstract = {The network algorithm of Mehta and Patel [1986] is currently the best general algorithm for computing exact probabilities in r x 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 {\textquoteleft}{\textquoteright}hybrid{\textquoteright}{\textquoteright} 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.},
	issn = {0098-3500},
	doi = {10.1145/168173.168412},
	author = {Clarkson, D B and Fan, Y-A and Joe, H}
}
