Cargando…

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. 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 t...

Descripción completa

Detalles Bibliográficos
Autores principales: Houbraken, Maarten, Demeyer, Sofie, Michoel, Tom, Audenaert, Pieter, Colle, Didier, Pickavet, Mario
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Public Library of Science 2014
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4039476/
https://www.ncbi.nlm.nih.gov/pubmed/24879305
http://dx.doi.org/10.1371/journal.pone.0097896
_version_ 1782318494154489856
author Houbraken, Maarten
Demeyer, Sofie
Michoel, Tom
Audenaert, Pieter
Colle, Didier
Pickavet, Mario
author_facet Houbraken, Maarten
Demeyer, Sofie
Michoel, Tom
Audenaert, Pieter
Colle, Didier
Pickavet, Mario
author_sort Houbraken, Maarten
collection PubMed
description 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.
format Online
Article
Text
id pubmed-4039476
institution National Center for Biotechnology Information
language English
publishDate 2014
publisher Public Library of Science
record_format MEDLINE/PubMed
spelling pubmed-40394762014-06-02 The Index-Based Subgraph Matching Algorithm with General Symmetries (ISMAGS): Exploiting Symmetry for Faster Subgraph Enumeration Houbraken, Maarten Demeyer, Sofie Michoel, Tom Audenaert, Pieter Colle, Didier Pickavet, Mario PLoS One Research Article 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. Public Library of Science 2014-05-30 /pmc/articles/PMC4039476/ /pubmed/24879305 http://dx.doi.org/10.1371/journal.pone.0097896 Text en © 2014 Houbraken et al http://creativecommons.org/licenses/by/4.0/ This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are properly credited.
spellingShingle Research Article
Houbraken, Maarten
Demeyer, Sofie
Michoel, Tom
Audenaert, Pieter
Colle, Didier
Pickavet, Mario
The Index-Based Subgraph Matching Algorithm with General Symmetries (ISMAGS): Exploiting Symmetry for Faster Subgraph Enumeration
title The Index-Based Subgraph Matching Algorithm with General Symmetries (ISMAGS): Exploiting Symmetry for Faster Subgraph Enumeration
title_full The Index-Based Subgraph Matching Algorithm with General Symmetries (ISMAGS): Exploiting Symmetry for Faster Subgraph Enumeration
title_fullStr The Index-Based Subgraph Matching Algorithm with General Symmetries (ISMAGS): Exploiting Symmetry for Faster Subgraph Enumeration
title_full_unstemmed The Index-Based Subgraph Matching Algorithm with General Symmetries (ISMAGS): Exploiting Symmetry for Faster Subgraph Enumeration
title_short The Index-Based Subgraph Matching Algorithm with General Symmetries (ISMAGS): Exploiting Symmetry for Faster Subgraph Enumeration
title_sort index-based subgraph matching algorithm with general symmetries (ismags): exploiting symmetry for faster subgraph enumeration
topic Research Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4039476/
https://www.ncbi.nlm.nih.gov/pubmed/24879305
http://dx.doi.org/10.1371/journal.pone.0097896
work_keys_str_mv AT houbrakenmaarten theindexbasedsubgraphmatchingalgorithmwithgeneralsymmetriesismagsexploitingsymmetryforfastersubgraphenumeration
AT demeyersofie theindexbasedsubgraphmatchingalgorithmwithgeneralsymmetriesismagsexploitingsymmetryforfastersubgraphenumeration
AT michoeltom theindexbasedsubgraphmatchingalgorithmwithgeneralsymmetriesismagsexploitingsymmetryforfastersubgraphenumeration
AT audenaertpieter theindexbasedsubgraphmatchingalgorithmwithgeneralsymmetriesismagsexploitingsymmetryforfastersubgraphenumeration
AT colledidier theindexbasedsubgraphmatchingalgorithmwithgeneralsymmetriesismagsexploitingsymmetryforfastersubgraphenumeration
AT pickavetmario theindexbasedsubgraphmatchingalgorithmwithgeneralsymmetriesismagsexploitingsymmetryforfastersubgraphenumeration
AT houbrakenmaarten indexbasedsubgraphmatchingalgorithmwithgeneralsymmetriesismagsexploitingsymmetryforfastersubgraphenumeration
AT demeyersofie indexbasedsubgraphmatchingalgorithmwithgeneralsymmetriesismagsexploitingsymmetryforfastersubgraphenumeration
AT michoeltom indexbasedsubgraphmatchingalgorithmwithgeneralsymmetriesismagsexploitingsymmetryforfastersubgraphenumeration
AT audenaertpieter indexbasedsubgraphmatchingalgorithmwithgeneralsymmetriesismagsexploitingsymmetryforfastersubgraphenumeration
AT colledidier indexbasedsubgraphmatchingalgorithmwithgeneralsymmetriesismagsexploitingsymmetryforfastersubgraphenumeration
AT pickavetmario indexbasedsubgraphmatchingalgorithmwithgeneralsymmetriesismagsexploitingsymmetryforfastersubgraphenumeration