Cargando…
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...
Autores principales: | Houbraken, Maarten, Demeyer, Sofie, Michoel, Tom, Audenaert, Pieter, Colle, Didier, Pickavet, Mario |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2014
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4039476/ https://www.ncbi.nlm.nih.gov/pubmed/24879305 http://dx.doi.org/10.1371/journal.pone.0097896 |
Ejemplares similares
-
The Index-Based Subgraph Matching Algorithm (ISMA): Fast Subgraph Enumeration in Large Networks Using Optimized Search Trees
por: Demeyer, Sofie, et al.
Publicado: (2013) -
Faster algorithms for counting subgraphs in sparse graphs
por: Bressan, Marco
Publicado: (2021) -
Edge-colored directed subgraph enumeration on the connectome
por: Matejek, Brian, et al.
Publicado: (2022) -
A linear delay algorithm for enumerating all connected induced subgraphs
por: Alokshiya, Mohammed, et al.
Publicado: (2019) -
SubRank: Subgraph Embeddings via a Subgraph Proximity Measure
por: Balalau, Oana, et al.
Publicado: (2020)