Bisected graph matching improves automated pairing of bilaterally homologous neurons from connectomes

Graph matching algorithms attempt to find the best correspondence between the nodes of two networks. These techniques have been used to match individual neurons in nanoscale connectomes—in particular, to find pairings of neurons across hemispheres. However, since graph matching techniques deal with...

Descripción completa

Detalles Bibliográficos
Autores principales: Pedigo, Benjamin D., Winding, Michael, Priebe, Carey E., Vogelstein, Joshua T.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MIT Press 2023
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10319359/
https://www.ncbi.nlm.nih.gov/pubmed/37409218
http://dx.doi.org/10.1162/netn_a_00287

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10319359/
https://www.ncbi.nlm.nih.gov/pubmed/37409218
http://dx.doi.org/10.1162/netn_a_00287

Ejemplares similares