The Index-based Subgraph Matching Algorithm with General Symmetries (ISMAGS): exploiting symmetry for faster subgraph enumeration.Subgraph matching algorithms are used to find and enumerate specific interconnection structures in networks.  In this work, we present the Index-based Subgraph Matching Algorithm with General Symmetries (ISMAGS), an improved version of the Index-based Subgraph Matching Algorithm (ISMA).  ISMA quickly finds all instances of a predefined motif in a network by intelligently exploring the search space and taking into account easily identifiable symmetric structures.  ISMAGS overcomes this problem by using a customised symmetry analysis phase to detect all symmetric structures in the network motif subgraphs.  For subgraphs with no or simple symmetric structures, ISMAGS still reduces computation times by optimising set operations.  An implementation of the algorithm is freely available at https://github.com/mhoubraken/ISMAGS.
ISMA
The Index-based Subgraph Matching Algorithm with General Symmetries (ISMAGS): exploiting symmetry for faster subgraph enumeration.Subgraph matching algorithms are used to find and enumerate specific interconnection structures in networks.  In this work, we present the Index-based Subgraph Matching Algorithm with General Symmetries (ISMAGS), an improved version of the Index-based Subgraph Matching Algorithm (ISMA).  ISMAGS overcomes this problem by using a customised symmetry analysis phase to detect all symmetric structures in the network motif subgraphs.  For subgraphs with no or simple symmetric structures, ISMAGS still reduces computation times by optimising set operations.  An implementation of the algorithm is freely available at https://github.com/mhoubraken/ISMAGS.
ISMAGS