Re^2: Algorithm for cancelling common factors between two lists of multiplicands

I'm am completely aware that all the other terms need to be calculated in order to determine whether the value is significant. I even mentioned this in 482056.

And, I guess I could be misusing your code, but when I feed it these values 5 0 4 1, it produces the same output exactly as my "misguided" code. Funnily enough, for those values, it produces the same output as tmoertel's (apparently equally misguided) code.

Is it only when given the larger set of test values 989 9400 43300 2400 that your special code does something extraordinarily clever that I'm to stupid to understand?

$T->start( '[5 0 1 4]' );
print Fishers_Exact::fishers_exact( 5, 0, 1, 4 );
$T->stop( '[5 0 1 4]'  );
$T->report;

$T->start( '[989 9400 43300 2400]' );
print Fishers_Exact::fishers_exact( 989, 9400, 43300, 2400 );
$T->stop( '[989 9400 43300 2400]' );
$T->report;

__END__
P:\test>FET-tlm.pl
0.02380952380952380952380952380
  1 trial  of [5 0 1 4] (    917us total), 917us/trial

0.9999999999999999999999999999999999999999999999999999999999999999999
999999999999999999999999999999999999999999999999999999999999999999999
999999999999999999999999999999999999999999999999999999999999999999999
999999999999999999999999999999999999999999999999999999999999999999999
999999999999999999999999999999999999999999999999999999999999999999999
999999999999999999999999999999999999999999999999999999999999999999999
999999999999999999999999999999999999999999999999999999999999999999999
99999999999999999999999999999999952665545273822897512768877675
  1 trial  of             [5 0 1 4] (    917us total), 917us/trial

  1 trial  of [989 9400 43300 2400] (   1.353s total), 1.353s/trial
[download]

Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.

Lingua non convalesco, consenesco et abolesco. -- Rule 1 has a caveat! -- Who broke the cabal?

"Science is about questioning the status quo. Questioning authority".

The "good enough" maybe good enough for the now, and perfection maybe unobtainable, but that should not preclude us from striving for perfection, when time, circumstance or desire allow.

Comment on Re^2: Algorithm for cancelling common factors between two lists of multiplicands Download Code

Replies are listed 'Best First'.
Re^3: Algorithm for cancelling common factors between two lists of multiplicands by tlm (Prior) on Aug 10, 2005 at 14:05 UTC
Of course our results will match in those rare cases in which the FET sum happens to contain only one term. Silence betokens consent Not necessarily ;-) . the lowliest monk	[reply]
Re^4: Algorithm for cancelling common factors between two lists of multiplicands by BrowserUk (Patriarch) on Aug 10, 2005 at 14:34 UTC
Of course our results will match in those rare cases in which the FET sum happens to contain only one term. Care to try and explain that? Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error. Lingua non convalesco, consenesco et abolesco. -- Rule 1 has a caveat! -- Who broke the cabal? "Science is about questioning the status quo. Questioning authority". The "good enough" maybe good enough for the now, and perfection maybe unobtainable, but that should not preclude us from striving for perfection, when time, circumstance or desire allow.	[reply] [d/l]
Re^5: Algorithm for cancelling common factors between two lists of multiplicands by tlm (Prior) on Aug 11, 2005 at 13:24 UTC
Care to try and explain that? Maybe Fisher's Exact Test will elucidate the matter. the lowliest monk	[reply]
Re^6: Algorithm for cancelling common factors between two lists of multiplicands by BrowserUk (Patriarch) on Aug 11, 2005 at 15:54 UTC
Re^7: Algorithm for cancelling common factors between two lists of multiplicands by tlm (Prior) on Aug 11, 2005 at 17:32 UTC


more useful options
	PerlMonks