The Index-Based Subgraph Matching Algorithm (ISMA): Fast Subgraph Enumeration in Large Networks Using Optimized Search Trees

Open Access

Peer-reviewed

Research Article

Sofie Demeyer ,

* E-mail: Sofie.Demeyer@intec.ugent.be

Affiliation Department of Information Technology, Ghent University, Ghent, Belgium
⨯
Tom Michoel,

Affiliations School of Life Sciences - LifeNet, Freiburg Institute of Advanced Studies, Freiburg, Germany, Division of Genetics and Genomics, The Roslin Institute - University of Edinburgh, Midlothian, Scotland, United Kingdom
⨯
Jan Fostier,

Affiliation Department of Information Technology, Ghent University, Ghent, Belgium
⨯
Pieter Audenaert,

Affiliation Department of Information Technology, Ghent University, Ghent, Belgium
⨯
Mario Pickavet,

Affiliation Department of Information Technology, Ghent University, Ghent, Belgium
⨯
Piet Demeester

Affiliation Department of Information Technology, Ghent University, Ghent, Belgium
⨯

x

Viewed

Powered by Altmetric

Questions or concerns about usage data? Please let us know.

Print

Network motifs
Is the Subject Area "Network motifs" applicable to this article?

Thanks for your feedback.
Algorithms
Is the Subject Area "Algorithms" applicable to this article?

Thanks for your feedback.
Reflection
Is the Subject Area "Reflection" applicable to this article?

Thanks for your feedback.
Permutation
Is the Subject Area "Permutation" applicable to this article?

Thanks for your feedback.
Protein interaction networks
Is the Subject Area "Protein interaction networks" applicable to this article?

Thanks for your feedback.
Protein-protein interactions
Is the Subject Area "Protein-protein interactions" applicable to this article?

Thanks for your feedback.
Computer software
Is the Subject Area "Computer software" applicable to this article?

Thanks for your feedback.
Yeast
Is the Subject Area "Yeast" applicable to this article?

Thanks for your feedback.