Cargando…
Edge-colored directed subgraph enumeration on the connectome
Following significant advances in image acquisition, synapse detection, and neuronal segmentation in connectomics, researchers have extracted an increasingly diverse set of wiring diagrams from brain tissue. Neuroscientists frequently represent these wiring diagrams as graphs with nodes correspondin...
Autores principales: | Matejek, Brian, Wei, Donglai, Chen, Tianyi, Tsourakakis, Charalampos E., Mitzenmacher, Michael, Pfister, Hanspeter |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group UK
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9256670/ https://www.ncbi.nlm.nih.gov/pubmed/35790766 http://dx.doi.org/10.1038/s41598-022-15027-7 |
Ejemplares similares
-
The frequent complete subgraphs in the human connectome
por: Fellner, Máté, et al.
Publicado: (2020) -
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) -
A linear delay algorithm for enumerating all connected induced subgraphs
por: Alokshiya, Mohammed, et al.
Publicado: (2019) -
Finding recurrent RNA structural networks with fast maximal common subgraphs of edge-colored graphs
por: Soulé, Antoine, et al.
Publicado: (2021)