twilight.permute.unpair       package:twilight       R Documentation

_A _p_e_r_m_u_t_a_t_i_o_n _m_a_t_r_i_x _o_f _u_n_p_a_i_r_e_d _c_l_a_s_s _l_a_b_e_l_s

_D_e_s_c_r_i_p_t_i_o_n:

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

_U_s_a_g_e:

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

_A_r_g_u_m_e_n_t_s:

       v: A binary vector representing class labels in original order. 

       m: A numerical value giving the number of permutations. 

     bal: Logical value. Results in balanced or unbalanced
          permutations. 

_V_a_l_u_e:

     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.

_A_u_t_h_o_r(_s):

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

_R_e_f_e_r_e_n_c_e_s:

     Scheid S and Spang R (2004): A stochastic downhill search
     algorithm for estimating the local false discovery rate, _IEEE
     TCBB_ *1(3)*, 98-108.

_S_e_e _A_l_s_o:

     'twilight.permute.pair', 'twilight.combi'

