Finding maximally disconnected subnetworks with shortest path tractography

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 th...
Source: NeuroImage: Clinical - Category: Radiology Source Type: research