The index-based subgraph matching algorithm (ISMA): fast subgraph enumeration in large networks using optimized search trees.

Article English OPEN
Demeyer, Sofie; Michoel, Tom; Fostier, Jan; Audenaert, Pieter; Pickavet, Mario; Demeester, Piet;
(2013)
  • Publisher: Public Library of Science (PLoS)
  • Journal: PLoS ONE,volume 8,issue 4 (issn: 1932-6203, eissn: 1932-6203)
  • Publisher copyright policies & self-archiving
  • Related identifiers: doi: 10.1371/journal.pone.0061183, pmc: PMC3631255
  • Subject: Agricultural and Biological Sciences(all) | Algorithms | Applied Mathematics | Research Article | Information Technology | Computing Methods | Mathematics | AGGREGATION | Technology and Engineering | ISOMORPHISM | Computer Science | Computational Systems | /dk/atira/pure/subjectarea/asjc/2700 | Genome Analysis Tools | Medicine(all) | Genomics | TOPOLOGICAL MOTIFS | Biology | Genetic Networks | Medicine | GRAPH | TOOL | /dk/atira/pure/subjectarea/asjc/1100 | Q | Biochemistry, Genetics and Molecular Biology(all) | R | Mathematical Computing | IBCN | /dk/atira/pure/subjectarea/asjc/1300 | Science | PRINCIPLES | Discrete Mathematics | Statistical Methods | Statistics
    arxiv: Mathematics::Combinatorics | Computer Science::Discrete Mathematics
    acm: MathematicsofComputing_DISCRETEMATHEMATICS

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... View more
Share - Bookmark