Fig. 1
From: Identification of large disjoint motifs in biological networks
a A graph G that contain seven nodes {a, b, c, d, e, f, g} and eight edges {(a,b), (a,c), (b,c), (b,e), (e,d), (e,f), (f,g), (e,g)}. b A pattern with two embeddings in G, {(a,b), (a,c), (b,c)} and {(e,f), (f,g), (e,g)}. c A pattern with three embeddings in G, {(a,b), (a,c), (b,c), (b,e)}, {(e,f), (f,g), (e,g), (e,d)}, and {(e,f), (f,g), (e,g), (b,e)}. d A pattern that has one copy in G, {(b,e), (e,d), (e,f), (f,g), (e,g)}