ISMA
ISMA efficiently identifies all occurrences of predefined subgraphs within large networks to enable discovery and analysis of network motifs.
Key Features:
- Tree-Based Algorithm: Employs a tree structure to systematically explore nodes within the query subgraph and optimize the order of investigation.
- Data Structures and Symmetry Exploitation: Leverages specialized data structures and exploits symmetry characteristics inherent in subgraphs to improve efficiency.
- Performance Optimization: Selects the node investigation sequence to achieve notable speedups, particularly on large networks and extensive query subgraphs.
Scientific Applications:
- Network Motif Discovery: Identifies subgraph patterns that occur more frequently than expected by chance for the analysis of network motifs.
- Biological Network Analysis: Facilitates structural and functional analysis of biological networks such as protein-protein interaction networks and gene regulatory networks.
Methodology:
Performs strategic traversal of query subgraph nodes guided by an optimized search tree structure, using specialized data structures and symmetry exploitation to determine node investigation order.
Topics
Details
- Tool Type:
- command-line tool
- Added:
- 5/17/2018
- Last Updated:
- 12/10/2018
Operations
Publications
Demeyer S, Michoel T, Fostier J, Audenaert P, Pickavet M, Demeester P. The Index-Based Subgraph Matching Algorithm (ISMA): Fast Subgraph Enumeration in Large Networks Using Optimized Search Trees. PLoS ONE. 2013;8(4):e61183. doi:10.1371/journal.pone.0061183. PMID:23620730. PMCID:PMC3631255.
Downloads
- Command-line specificationhttps://sourceforge.net/projects/isma/files/latest/download