Cargando…
Finding maximally disconnected subnetworks with shortest path tractography
Connectome-based lesion symptom mapping (CLSM) can be used to relate disruptions of brain network connectivity with clinical measures. We present a novel method that extends current CLSM approaches by introducing a fast reliable and accurate way for computing disconnectomes, i.e. identifying damaged...
Autores principales: | , , , , , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Elsevier
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6627647/ https://www.ncbi.nlm.nih.gov/pubmed/31491834 http://dx.doi.org/10.1016/j.nicl.2019.101903 |
_version_ | 1783434785670037504 |
---|---|
author | Greene, Clint Cieslak, Matthew Volz, Lukas J. Hensel, Lukas Grefkes, Christian Rose, Ken Grafton, Scott T. |
author_facet | Greene, Clint Cieslak, Matthew Volz, Lukas J. Hensel, Lukas Grefkes, Christian Rose, Ken Grafton, Scott T. |
author_sort | Greene, Clint |
collection | PubMed |
description | Connectome-based lesion symptom mapping (CLSM) can be used to relate disruptions of brain network connectivity with clinical measures. We present a novel method that extends current CLSM approaches by introducing a fast reliable and accurate way for computing disconnectomes, i.e. identifying damaged or lesioned connections. We introduce a new algorithm that finds the maximally disconnected subgraph containing regions and region pairs with the greatest shared connectivity loss. After normalizing a stroke patient's segmented MRI lesion into template space, probability weighted structural connectivity matrices are constructed from shortest paths found in white matter voxel graphs of 210 subjects from the Human Connectome Project. Percent connectivity loss matrices are constructed by measuring the proportion of shortest-path probability weighted connections that are lost because of an intersection with the patient's lesion. Maximally disconnected subgraphs of the overall connectivity loss matrix are then derived using a computationally fast greedy algorithm that closely approximates the exact solution. We illustrate the approach in eleven stroke patients with hemiparesis by identifying expected disconnections of the corticospinal tract (CST) with cortical sensorimotor regions. Major disconnections are found in the thalamus, basal ganglia, and inferior parietal cortex. Moreover, the size of the maximally disconnected subgraph quantifies the extent of cortical disconnection and strongly correlates with multiple clinical measures. The methods provide a fast, reliable approach for both visualizing and quantifying the disconnected portion of a patient's structural connectome based on their routine clinical MRI, without reliance on concomitant diffusion weighted imaging. The method can be extended to large databases of stroke patients, multiple sclerosis or other diseases causing focal white matter injuries helping to better characterize clinically relevant white matter lesions and to identify biomarkers for the recovery potential of individual patients. |
format | Online Article Text |
id | pubmed-6627647 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2019 |
publisher | Elsevier |
record_format | MEDLINE/PubMed |
spelling | pubmed-66276472019-07-23 Finding maximally disconnected subnetworks with shortest path tractography Greene, Clint Cieslak, Matthew Volz, Lukas J. Hensel, Lukas Grefkes, Christian Rose, Ken Grafton, Scott T. Neuroimage Clin Regular Article Connectome-based lesion symptom mapping (CLSM) can be used to relate disruptions of brain network connectivity with clinical measures. We present a novel method that extends current CLSM approaches by introducing a fast reliable and accurate way for computing disconnectomes, i.e. identifying damaged or lesioned connections. We introduce a new algorithm that finds the maximally disconnected subgraph containing regions and region pairs with the greatest shared connectivity loss. After normalizing a stroke patient's segmented MRI lesion into template space, probability weighted structural connectivity matrices are constructed from shortest paths found in white matter voxel graphs of 210 subjects from the Human Connectome Project. Percent connectivity loss matrices are constructed by measuring the proportion of shortest-path probability weighted connections that are lost because of an intersection with the patient's lesion. Maximally disconnected subgraphs of the overall connectivity loss matrix are then derived using a computationally fast greedy algorithm that closely approximates the exact solution. We illustrate the approach in eleven stroke patients with hemiparesis by identifying expected disconnections of the corticospinal tract (CST) with cortical sensorimotor regions. Major disconnections are found in the thalamus, basal ganglia, and inferior parietal cortex. Moreover, the size of the maximally disconnected subgraph quantifies the extent of cortical disconnection and strongly correlates with multiple clinical measures. The methods provide a fast, reliable approach for both visualizing and quantifying the disconnected portion of a patient's structural connectome based on their routine clinical MRI, without reliance on concomitant diffusion weighted imaging. The method can be extended to large databases of stroke patients, multiple sclerosis or other diseases causing focal white matter injuries helping to better characterize clinically relevant white matter lesions and to identify biomarkers for the recovery potential of individual patients. Elsevier 2019-06-18 /pmc/articles/PMC6627647/ /pubmed/31491834 http://dx.doi.org/10.1016/j.nicl.2019.101903 Text en © 2019 The Authors http://creativecommons.org/licenses/by/4.0/ This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/). |
spellingShingle | Regular Article Greene, Clint Cieslak, Matthew Volz, Lukas J. Hensel, Lukas Grefkes, Christian Rose, Ken Grafton, Scott T. Finding maximally disconnected subnetworks with shortest path tractography |
title | Finding maximally disconnected subnetworks with shortest path tractography |
title_full | Finding maximally disconnected subnetworks with shortest path tractography |
title_fullStr | Finding maximally disconnected subnetworks with shortest path tractography |
title_full_unstemmed | Finding maximally disconnected subnetworks with shortest path tractography |
title_short | Finding maximally disconnected subnetworks with shortest path tractography |
title_sort | finding maximally disconnected subnetworks with shortest path tractography |
topic | Regular Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6627647/ https://www.ncbi.nlm.nih.gov/pubmed/31491834 http://dx.doi.org/10.1016/j.nicl.2019.101903 |
work_keys_str_mv | AT greeneclint findingmaximallydisconnectedsubnetworkswithshortestpathtractography AT cieslakmatthew findingmaximallydisconnectedsubnetworkswithshortestpathtractography AT volzlukasj findingmaximallydisconnectedsubnetworkswithshortestpathtractography AT hensellukas findingmaximallydisconnectedsubnetworkswithshortestpathtractography AT grefkeschristian findingmaximallydisconnectedsubnetworkswithshortestpathtractography AT roseken findingmaximallydisconnectedsubnetworkswithshortestpathtractography AT graftonscottt findingmaximallydisconnectedsubnetworkswithshortestpathtractography |