Figure 2
From: Minimizing recombinations in consensus networks for phylogeographic studies
Given trees T1 in (a) and T2 in (b), each of height 3. (c) These two trees define X l , 1 ≤ l ≤ 3, for each level l. Note that the entries in X l , l > 1 differ in details depending on the choices the DSR algorithm makes. While '∅' denotes an empty set, '?' (including '{·}') could be either empty or non-empty, again depending on the choices the DSR Scheme makes.