Maclist                package:Icens                R Documentation

_A _f_u_n_c_t_i_o_n _t_o

_D_e_s_c_r_i_p_t_i_o_n:

     Returns a list of maximal cliques of the intersction graph of the
     real valued intervals supplied in 'm'. These are one dimensional
     intervals with one interval for each individual. The algorithm is
     coded in interpreted code and should be moved to compiled code for
     speed. How do we handle exact failure times? Which algorithm is
     used?

_U_s_a_g_e:

     Maclist(intvls, Lopen=TRUE, Ropen=FALSE)

_A_r_g_u_m_e_n_t_s:

  intvls: A n by 2 matrix, the first column is the left endpoints and
          the second column contains the right endpoints of the failure
          time intervals.

   Lopen: A boolean indicating whether the intervals are open on the
          left.

   Ropen: A boolean indicating whether the intervals are open on the
          right.

_V_a_l_u_e:

     A list of length m. Each element of the list corresponds to one
     maximal antichain. The row numbers (from 'm') identify the
     individuals and all row numbers for the individuals in the maximal
     clique. Maximal cliques occur in their natural (left to right)
     order.

_A_u_t_h_o_r(_s):

     Alain Vandal and Robert Gentleman

_R_e_f_e_r_e_n_c_e_s:

     Computational Methods for Censored Data using Intersection Graphs,
     R. Gentleman and A. Vandal, JCGS, 2000.

_S_e_e _A_l_s_o:

     'Macmat'

_E_x_a_m_p_l_e_s:

        data(cosmesis)
        csub1 <- subset(cosmesis, subset=Trt==0, select=c(L,R))
        ml1 <- Maclist(csub1)

