The index-based subgraph matching algorithm (ISMA): fast subgraph enumeration in large networks using optimized search trees.
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 subgr...
Guardado en:
| Autores principales: | , , , , , |
|---|---|
| Formato: | article |
| Lenguaje: | EN |
| Publicado: |
Public Library of Science (PLoS)
2013
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/ad94542584ea4c32af481b9f54acf72b |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|