twilight.permute.pair {twilight} | R Documentation

## A permutation matrix of paired class labels

### Description

The function returns a matrix where each row is a (un)balanced permutation of the input twosample class labels.

### Usage

    twilight.permute.pair(v, m, bal = TRUE)

### Arguments

`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.

### Value

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.

### Author(s)

Stefanie Scheid http://www.molgen.mpg.de/~scheid

### References

Scheid S and Spang R (2004): A stochastic downhill search algorithm for estimating the local false discovery rate, IEEE TCBB 1(3), 98–108.

### See Also

`twilight.permute.unpair`, `twilight.combi`

[Package twilight version 1.1.0 Index]