Matches in UGent Biblio for { <https://biblio.ugent.be/publication/4089593#aggregation> ?p ?o. }
Showing items 1 to 36 of
36
with 100 items per page.
- aggregation classification "A1".
- aggregation creator B785813.
- aggregation creator person.
- aggregation creator person.
- aggregation creator person.
- aggregation creator person.
- aggregation creator person.
- aggregation date "2013".
- aggregation format "application/pdf".
- aggregation hasFormat 4089593.bibtex.
- aggregation hasFormat 4089593.csv.
- aggregation hasFormat 4089593.dc.
- aggregation hasFormat 4089593.didl.
- aggregation hasFormat 4089593.doc.
- aggregation hasFormat 4089593.json.
- aggregation hasFormat 4089593.mets.
- aggregation hasFormat 4089593.mods.
- aggregation hasFormat 4089593.rdf.
- aggregation hasFormat 4089593.ris.
- aggregation hasFormat 4089593.txt.
- aggregation hasFormat 4089593.xls.
- aggregation hasFormat 4089593.yaml.
- aggregation isPartOf urn:issn:1932-6203.
- aggregation language "eng".
- aggregation rights "I have transferred the copyright for this publication to the publisher".
- aggregation subject "Technology and Engineering".
- aggregation title "The index-based subgraph matching algorithm (ISMA): fast subgraph enumeration in large networks using optimized search trees".
- aggregation abstract "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.".
- aggregation authorList BK1156391.
- aggregation issue "4".
- aggregation volume "8".
- aggregation aggregates 4089640.
- aggregation aggregates 4089646.
- aggregation isDescribedBy 4089593.
- aggregation similarTo journal.pone.0061183.
- aggregation similarTo LU-4089593.