Skip to main content
Fig. 4 | BMC Bioinformatics

Fig. 4

From: Identification of large disjoint motifs in biological networks

Fig. 4

a A subgraph S 2 in a hypothetical graph G. S 2 is isomorphic to a pattern P2 of size k+1 edges. If we remove the additional edge (a,b) we obtain S 1 which is isomorphic to P 1 where P 1P 2. Notice that S 1 could have arbitrary k−1 edges rather than (b,c). Here we obtain S 2 as a result of joining S 1 with the subgraph {(a,b),(b,c)} which belongs to M1 equivalence class (see Fig. 2 a). b Failure to accomplish the join in (a), we seek to inspect d e g(c) and d e g(b) in S 1. The first possibility is that d e g(c)>1. This means that the subgraph {(b,c),(c,d)} exists. We then can join S 1 with the subgraph {(a,b),(b,c),(c,d)} which belongs to M4 equivalence class (see Fig. 2 d) to obtain S 2 which is isomorphic to a pattern P2 of size k+1 edges. c The second possibility is that d e g(b)>1. This means that the subgraph {(b,c),(b,d)} exists. We then can join S 1 with the subgraph {(a,b),(b,c),(b,d)} which belongs to M3 equivalence class (see Fig. 2 c) to obtain S 2

Back to article page
\