Figure 3From: Algorithms: simultaneous error-correction and rooting for gene tree reconciliation and the gene duplication problemNNI. A single NNI on and G ^ . On the left ei and e i ′ (for i = 0, ... , 4) denote edges in and its NNI-neighbor G ′ , respectively. On the right each node a i denote the labeling of edges in G ^ . Notation ā i denote the lca-mapping of complementary subtrees, for instance, ā 3 = a 1 + a 2 + a 4 , etc. For brevity, we omit each subtree T i attached to w i in the left diagram.Back to article page