Advertisement
Browse Subject Areas
?

Click through the PLOS taxonomy to find articles in your field.

For more information about PLOS Subject Areas, click here.

< Back to Article

The Index-Based Subgraph Matching Algorithm (ISMA): Fast Subgraph Enumeration in Large Networks Using Optimized Search Trees

Figure 2

Examples of motifs and their specifications.

Here nodes are denoted by their index. Look at for example the motif AAAB000B0A00BAA. Its motif specification can be deduced as follows: a directed link of type from node 1 to node 2, a directed link of type from node 1 to node 3, a directed link of type from node 2 to node 3, a directed link of type from node 1 to node 4, no link between node 2 and node 4, no link between node 3 and node 4, no link between node 1 and node 5, a directed link of type from node 2 to node 5, no link between node 3 and node 5, a directed link of type from node 4 to node 5, no link between node 1 and node 6, no link between node 2 and node 6, a directed link of type from node 3 to node 6, a directed link of type from node 4 to node 6, a directed link of type from node 5 to node 6.

Figure 2

doi: https://doi.org/10.1371/journal.pone.0061183.g002