Here, we follow an approach that has previously been employed for finding and characterizing allosteric pathways in proteins . A graph representation is constructed using the graph generation part of the WISP (Weighted Implementation of Suboptimal Paths) script developed by Wart et al. . The C α atoms are chosen as nodes, which are connected by edges, to which weights (corresponding to a distance in "network space" between the nodes) are assigned according to