Fig. 4
From: New algorithms for structure informed genome rearrangement
a PQ-tree T. b PQ-tree \(T'\) which is quasi-equivalent to T. The colors are represented by the number assigned to each node, the labels of the leaves are the letters. Each internal node is T is marked by a letter (x for example), and its equivalent node is marked by the same letter with a dash (\(x'\))