The Index-Based Subgraph Matching Algorithm ISMA: Fast Subgraph Enumeration in Large Networks Using Optimized Search TreesReport as inadecuate




The Index-Based Subgraph Matching Algorithm ISMA: Fast Subgraph Enumeration in Large Networks Using Optimized Search Trees - Download this document for free, or read online. Document in PDF available to download.

Subgraph matching algorithms are designed to find all instances of predefined subgraphs in a large graph or network and play an important role in the discovery and analysis of so-called network motifs, subgraph patterns which occur more often than expected by chance. We present the index-based subgraph matching algorithm ISMA, a novel tree-based algorithm. ISMA realizes a speedup compared to existing algorithms by carefully selecting the order in which the nodes of a query subgraph are investigated. In order to achieve this, we developed a number of data structures and maximally exploited symmetry characteristics of the subgraph. We compared ISMA to a naive recursive tree-based algorithm and to a number of well-known subgraph matching algorithms. Our algorithm outperforms the other algorithms, especially on large networks and with large query subgraphs. An implementation of ISMA in Java is freely available at http:-sourceforge.net-projects-isma-.



Author: Sofie Demeyer , Tom Michoel, Jan Fostier, Pieter Audenaert, Mario Pickavet, Piet Demeester

Source: http://plos.srce.hr/



DOWNLOAD PDF




Related documents