Figure 1
From: Local search for the generalized tree alignment problem
Breaking and joining a tree. Breaking a tree in two connected components, and joining them again with a different edge. The resulting tree is part of T’s TBR neighborhood.
Figure 1 | BMC Bioinformatics