
Network Motif Discovery
189
2
5
4
3
7
6
1
1
2
3
5
6
7
1
2
3
6
5
7
4
1
2
3
6
5
7
4
1
2
3
5
4
_
6
1
2
3
5
4
6
7
1
4
5
6
7
1
2
3
5
6
7
4
1
2
3
6
5
7
4
a
1
2
3
5
6
7
1
2
3
5
1
2
3
6
7
4
1
2
3
5
6
7
1
2
3
5
6
7
1
2
3
5
6
7
1
2
3
6
5
7
4
1
2
3
6
7
4
1
2
3
5
1
2
7
98
1
_
_
_ _
6
7
5
1
2
3
6
5
7
4
1
2
3
6
5
7
4
1
2
3
6
5
7
4
4
4
4
3
2
3
4
1
2
3
5
6
7
4
1
2
3
5
6
7
4
1
2
3
5
6
7
4
65
5
5
cb
d
2
3
4
Figure 9.10: Motifs found in a graph using Kavosh algorithm (adapted from [8])
the query graph in the target network. If the input query graph is a supergraph of
a previous query graph, the previous mapping information is used to reduce com-
putation time. The algorithm uses the concept of expansion trees T
k
to prepare