Skip to main content
. 2018 Jun 14;80(8):2177–2208. doi: 10.1007/s11538-018-0452-0

Table 1.

New diameter bounds for several rearrangement moves

Move Diameter of tier k networks with n leaves
Lower bound Upper bound
rSPR n-Θ(n) 2n+3k
Tail n-Θ(n) 3(n+2k)
rNNI Ω(nlog(n)) O(n2)
Tail1 Ω(nlog(n)) O(n2)
SPR n+83k