Fig. 2From: Efficiently sparse listing of classes of optimal cophylogeny reconciliationsExample of a reconciliation graph for the input \((H,P,\sigma )\) in Fig. 1. Crossed circles are AND nodes. Rectangles are \(\text {OR}^+\) nodes. The cells with which the \(\text {OR}^+\) nodes are labeled are written inside. One solution subtree is shown in boldBack to article page