Skip to main content
. 2024 Oct 30;11:1432495. doi: 10.3389/fmolb.2024.1432495

FIGURE 2.

FIGURE 2

Graphical representation of the partitioning and result merging processes. After contraction, any edge on any min-cut of the proper cluster graph (left) is removed. Min-Cut Supertree is recursively called on the induced subtrees of the components of the proper cluster graph, making the roots of the resulting trees adjacent to a new root vertex (right).