Fig. 3From: On the computational complexity of the maximum parsimony reconciliation problem in the duplication-loss-coalescence modelA small example of the reduction for a single clause \((x_1 \vee \overline{x}_2 \vee x_3)\) Back to article page