> On 12 Feb 2019, at 02:45 , Bert Gunter wrote:
>
> 1. I believe Fisher's exact test is computationally intensive and takes a
> lot of time for large structures, so I would say what you see is what you
> should expect! (As I'm not an expert on this, confirmation or contradiction
> by those who
Point 1 confirmed. It's an exhaustive permutation test.
On 2/11/19, 8:46 PM, "R-help on behalf of Bert Gunter"
wrote:
1. I believe Fisher's exact test is computationally intensive and takes a
lot of time for large structures, so I would say what you see is what you
should expect! (
1. I believe Fisher's exact test is computationally intensive and takes a
lot of time for large structures, so I would say what you see is what you
should expect! (As I'm not an expert on this, confirmation or contradiction
by those who are would be appreciated).
2. Your second question on how to
Dear group,
I have two large matrices.
Matrix one: is 24776 x 76 (example toy1 dput object given below)
Matrix two: is 12913 x 76 (example toy2 dput object given below)
Column names of both matrices are identical.
My aim is:
a. Take each row of toy2 and transform vector into UP (>0) and DN (
4 matches
Mail list logo
