» Q2. (50%) Given the same genotype matrix G.
> Design an algorithm to solve K mutual-exclusive-set problem:
Find K sets of columns, where
+ Minimize the number of the sets, K;
+ Maximize the number of columns covered by the K sets;
+ One column cannot covered by multiple sets;
+ For any two sets $k_i$ and $k_j$, they are almost mutual exclusive,
which means, for most of the rows, if the columns in $k_i$ carry
one or more "1"s, then the columns in $k_j$ cannot carry any
"1"; vice versa;
+ Maximize the number of rows following the mutual exclusive
rule.