A remark on algorithm-643 - FEXACT - An algorithm for performing fishers exact test in r x c contingency-tables

Subscribe to email list

Please select the email list(s) to which you wish to subscribe.
CAPTCHA
This question is for testing whether or not you are a human visitor and to prevent automated spam submissions.
Image CAPTCHA

Enter the characters shown in the image.

User menu

You are here

  1. Department of Statistics
  2. A remark on algorithm-643 - FEXACT - An algorithm for performing fishers exact test in r x c contingency-tables

A remark on algorithm-643 - FEXACT - An algorithm for performing fishers exact test in r x c contingency-tables

TitleA remark on algorithm-643 - FEXACT - An algorithm for performing fishers exact test in r x c contingency-tables
Publication TypeJournal Article
Year of Publication1993
AuthorsClarkson, DB, Fan, Y-A, Joe, H
JournalACM Transactions on Mathematical Software
Volume19
Pagination484-488
Date PublishedDEC
ISSN0098-3500
AbstractThe 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 `'hybrid'' 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.
DOI10.1145/168173.168412