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

*Demeyer, Sofie*;

*Michoel, Tom*;

*Fostier, Jan*;

*Audenaert, Pieter*;

*Pickavet, Mario*;

*Demeester, Piet*;

- Publisher: Public Library of Science (PLoS)
- Journal: PLoS ONE,volume 8,issue 4 (issn: 1932-6203, eissn: 1932-6203)
Related identifiers: , - 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 | Statisticsarxiv: Mathematics::Combinatorics | Computer Science::Discrete Mathematicsacm: 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

- References (37)
- Related Research Results (7) Inferred by OpenAIRE
- Related Organizations (2)
Ghent University ( Ghent University ) BelgiumWebsite url: https://www.ugent.be/en90%Universiteit Gent 90% - Metrics

Share - Bookmark

- Download from