Observed that with gapless data the set of irredundant reads and their conflict information induce a partial order.
Dilworth's theorem applies, and it is sufficient to find a chain decomposition of a transitive orientation, , of the compatibility graph.