Bisected graph matching improves automated pairing of bilaterally homologous neurons from connectomes
AbstractGraph 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 matchi...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
The MIT Press
2023-01-01
|
| Series: | Network Neuroscience |
| Online Access: | https://direct.mit.edu/netn/article/7/2/522/113527/Bisected-graph-matching-improves-automated-pairing |