Fig. 4.

Comparison between MutExMatSorting and MEMo algorithms in maximizing the mutual-exclusivity coverage score. We compared the MutExMatSorting and MEMo algorithms in their ability to rearrange an input BM for highlighting mutual-exclusivity patterns. In particular, we tested different matrix sizes (i.e. the number of rows and columns) and densities (i.e. the ratio between the non-zero entries and the total entries in the BM). For each combination of parameters, we performed 1000 iterations. As a baseline, we considered the original unsorted BM. All differences, in terms of performances, between the unsorted and MEMo-arranged matrix as well as those between the latter and MutExMatSorting-arranged matrix are highly significant (P < 10⁻⁴)