IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0097896.html
   My bibliography  Save this article

The Index-Based Subgraph Matching Algorithm with General Symmetries (ISMAGS): Exploiting Symmetry for Faster Subgraph Enumeration

Author

Listed:
  • Maarten Houbraken
  • Sofie Demeyer
  • Tom Michoel
  • Pieter Audenaert
  • Didier Colle
  • Mario Pickavet

Abstract

Subgraph matching algorithms are used to find and enumerate specific interconnection structures in networks. By enumerating these specific structures/subgraphs, the fundamental properties of the network can be derived. More specifically in biological networks, subgraph matching algorithms are used to discover network motifs, specific patterns occurring more often than expected by chance. Finding these network motifs yields information on the underlying biological relations modelled by the network. 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. However, more complex symmetries (possibly involving switching multiple nodes) are not taken into account, resulting in superfluous output. ISMAGS overcomes this problem by using a customised symmetry analysis phase to detect all symmetric structures in the network motif subgraphs. These structures are then converted to symmetry-breaking constraints used to prune the search space and speed up calculations. The performance of the algorithm was tested on several types of networks (biological, social and computer networks) for various subgraphs with a varying degree of symmetry. For subgraphs with complex (multi-node) symmetric structures, high speed-up factors are obtained as the search space is pruned by the symmetry-breaking constraints. For subgraphs with no or simple symmetric structures, ISMAGS still reduces computation times by optimising set operations. Moreover, the calculated list of subgraph instances is minimal as it contains no instances that differ by only a subgraph symmetry. An implementation of the algorithm is freely available at https://github.com/mhoubraken/ISMAGS.

Suggested Citation

  • Maarten Houbraken & Sofie Demeyer & Tom Michoel & Pieter Audenaert & Didier Colle & Mario Pickavet, 2014. "The Index-Based Subgraph Matching Algorithm with General Symmetries (ISMAGS): Exploiting Symmetry for Faster Subgraph Enumeration," PLOS ONE, Public Library of Science, vol. 9(5), pages 1-15, May.
  • Handle: RePEc:plo:pone00:0097896
    DOI: 10.1371/journal.pone.0097896
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0097896
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0097896&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0097896?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Harjunen, Oskari & Saarimaa, Tuukka & Tukiainen, Janne, 2021. "Political representation and effects of municipal mergers," Political Science Research and Methods, Cambridge University Press, vol. 9(1), pages 72-88, January.
    2. Ine Melckenbeeck & Pieter Audenaert & Tom Michoel & Didier Colle & Mario Pickavet, 2016. "An Algorithm to Automatically Generate the Combinatorial Orbit Counting Equations," PLOS ONE, Public Library of Science, vol. 11(1), pages 1-19, January.
    3. Lucas Potin & Rosa Figueiredo & Vincent Labatut & Christine Largeron, 2023. "Pattern Mining for Anomaly Detection in Graphs: Application to Fraud in Public Procurement," Post-Print hal-04131485, HAL.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0097896. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.