Skip to content
Prev 378552 / 398502 Next

faster execution of for loop in Fishers test

As I read it, it is mainly 24776 * 12913 = "a lot" of 3x2 tables (320 million of them). Fisher.test has a fair amount of red-tape overhead, so brute force would take a while.

Some observations: All tables have a total of 76, so there is only a limited number of possible tables (but will kx always have only three possible values?), so there could be scope for using lookup tables. Also, if it is always 3x2, I think simulation is slower than exact computation.

-pd