Skip to main content
Fig. 1 | BMC Bioinformatics

Fig. 1

From: Topological structure analysis of chromatin interaction networks

Fig. 1

Overview of method for identifying network components. The initial data are represented by a rooted tree with graphs (networks) assigned to its nodes in such a way that graphs assigned to child nodes are (not necessarily proper) subgraphs of the graph assigned to their parent node. The problem is to find a set of ’characteristic’ components (subgraphs) that best differentiate between all the pairs of graphs assigned to the nodes. Although this can be done by a straightforward two-step approach: 1) finding such characteristic set for all pairs of nodes, and 2) combining these sets into a single set that does not contain identical or very similar components, the proposed method does this by a one-pass traversal of the tree significantly reducing time and space requirements

Back to article page