Cargando…
A linear delay algorithm for enumerating all connected induced subgraphs
BACKGROUND: Real biological and social data is increasingly being represented as graphs. Pattern-mining-based graph learning and analysis techniques report meaningful biological subnetworks that elucidate important interactions among entities. At the backbone of these algorithms is the enumeration o...
Autores principales: | Alokshiya, Mohammed, Salem, Saeed, Abed, Fidaa |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6584512/ https://www.ncbi.nlm.nih.gov/pubmed/31216984 http://dx.doi.org/10.1186/s12859-019-2837-y |
Ejemplares similares
-
RASMA: a reverse search algorithm for mining maximal frequent subgraphs
por: Salem, Saeed, et al.
Publicado: (2021) -
The Index-Based Subgraph Matching Algorithm with General Symmetries (ISMAGS): Exploiting Symmetry for Faster Subgraph Enumeration
por: Houbraken, Maarten, et al.
Publicado: (2014) -
The Index-Based Subgraph Matching Algorithm (ISMA): Fast Subgraph Enumeration in Large Networks Using Optimized Search Trees
por: Demeyer, Sofie, et al.
Publicado: (2013) -
Edge-colored directed subgraph enumeration on the connectome
por: Matejek, Brian, et al.
Publicado: (2022) -
Faster algorithms for counting subgraphs in sparse graphs
por: Bressan, Marco
Publicado: (2021)