Fig. 2
From: A practical exact maximum compatibility algorithm for reconstruction of recent evolutionary history
The recursive maximum weight clique algorithm. A\B indicates the set difference between A and B, i.e., the set of all elements of A that are not elements of B. N(v) indicates the set of all vertices that are neighbors of (i.e., compatible with) vertex v. wt(x) indicates the weight of a vertex or the sum of the weights of a set of vertices. R[i] indicates the index of the end of the range of vertices following v i that share its pattern of conflicts with all vertices v j with j > i (see text)