The Index-based Subgraph Matching Algorithm with General Symmetries (ISMAGS): exploiting symmetry for faster subgraph enumeration.
Subgraph matching algorithms are used to find and enumerate specific interconnection structures in networks. By enumerating these specific structures/subgraphs, the fundamental properties of the network can be derived. More specifically in biological networks, subgraph matching algorithms are used t...
Guardado en:
Autores principales: | Maarten Houbraken, Sofie Demeyer, Tom Michoel, Pieter Audenaert, Didier Colle, Mario Pickavet |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Public Library of Science (PLoS)
2014
|
Materias: | |
Acceso en línea: | https://doaj.org/article/acf55fd884a3421096d6705bdbfcf37b |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
The index-based subgraph matching algorithm (ISMA): fast subgraph enumeration in large networks using optimized search trees.
por: Sofie Demeyer, et al.
Publicado: (2013) -
Approximate subgraph matching-based literature mining for biomedical events and relations.
por: Haibin Liu, et al.
Publicado: (2013) -
MSGCN: Multi-Subgraph Based Heterogeneous Graph Convolution Network Embedding
por: Junhui Chen, et al.
Publicado: (2021) -
A novel rule generator for intrusion detection based on frequent subgraph mining
por: Herrera-Semenets,Vitali, et al.
Publicado: (2017) -
Local clustering via approximate heat kernel PageRank with subgraph sampling
por: Zhenqi Lu, et al.
Publicado: (2021)