Authors

Citation

Db. Clarkson et al., A REMARK ON ALGORITHM-643 - FEXACT - AN ALGORITHM FOR PERFORMING FISHERS EXACT TEST IN R X C CONTINGENCY-TABLES, ACM transactions on mathematical software, 19(4), 1993, pp. 484-488

Citations number

9

Language

INGLESE

art.tipo

Note

Categorie Soggetti

Computer Sciences",Mathematics

Journal title

ISSN journal

0098-3500

Volume

19

Issue

4

Year of publication

1993

Pages

484 - 488

Database

ISI

SICI code

0098-3500(1993)19:4<484:AROA-F>2.0.ZU;2-V

Abstract

The network algorithm of Mehta and Patel [1986] is currently the best
general algorithm for computing exact probabilities in r x c contingen
cy tables with fixed marginals. Given here are some improvements to th
e network algorithm which speed its computational performance; and thu
s increases the size of problems which can be handled. The new code al
so eliminates some programming restrictions in the old code, implement
s the ''hybrid'' algorithm of Mehta and Patel [1986a], and demonstrate
s that the exact path length bounds of Joe [1988] should always be use
d in place of the approximate bounds of Mehta and Patel [1986]. The ne
w code can be much faster than the old code in some problems.