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...

Descripción completa

Detalles Bibliográficos
Autores principales: Demeyer, Sofie, Michoel, Tom, Fostier, Jan, Audenaert, Pieter, Pickavet, Mario, Demeester, Piet
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Public Library of Science 2013
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3631255/
https://www.ncbi.nlm.nih.gov/pubmed/23620730
http://dx.doi.org/10.1371/journal.pone.0061183

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3631255/
https://www.ncbi.nlm.nih.gov/pubmed/23620730
http://dx.doi.org/10.1371/journal.pone.0061183

Ejemplares similares