twilight.permute.pair {twilight} | R Documentation |
The function returns a matrix where each row is a (un)balanced permutation of the input twosample class labels.
twilight.permute.pair(v, m, bal = TRUE)
v |
A binary vector representing class labels in original order. Pairs must be in the same order. |
m |
A numerical value giving the number of permutations. |
bal |
Logical value. Results in balanced or unbalanced permutations. |
Returns a matrix where each row contains one permuted vector of class labels. Note that even for balanced permutations, the first row always contains the original vector.
Stefanie Scheid http://www.molgen.mpg.de/~scheid
Scheid S and Spang R (2004): A stochastic downhill search algorithm for estimating the local false discovery rate, IEEE TCBB 1(3), 98–108.
twilight.permute.unpair
, twilight.combi