Fig. 3
From: Topological structure analysis of chromatin interaction networks
Search tree of FINDNETWORKCOMPONENTS algorithm. Schematic representation of part (limited to a single CC at the root) of binomial search tree constructed and traversed by FINDNETWORKCOMPONENTS algorithm. The binomial tree corresponding to all subsets of \(\mathcal {T}\) is additionally branched due to the possibility of CCs to split into several at the next depth level. The search tree is pruned: 1) below components with less than nmin vertices (these are simply not added to the tree); 2) below components reaching significance score threshold (components C1,1({t1,t3}),C2({t3}),C2({t3})); 3) components C(T) that are subgraphs of already found components C′(T′) with T′⊆T (component C1,1({t2,t3})). Here for brevity C(T) is used to denote G(C,T)