Figure 7From: Reconstructing genome mixtures from partial adjacenciesRepresenting conjunctions with cycles. (a) Three cycles representing the literals x ̄ , ȳ, and z, and the conjunction edges (bold) for a conjunction Δ= x ̄ ∧ȳ∧z. (b) For x = y = false and z = true we obtain the conjunction-cycle Δ of length 6. (c) Any other assignment (e.g., x = true) destroys the conjunction cycle.Back to article page