Fig 2. Two networks such that any sequence of rooted LST moves transforming one into the other goes through a tree.

LST moves are defined as in Huber et al. [25]. Note that a tree is a less complex model than either of these networks. The rearrangement moves proposed here (rNNI, see below) can transform each of these networks directly into the other (see third line in Fig 8, with γ = c and δ = b).