A non-directional network chart with the PPI data gained from STRING was established, and the connection of their shortest path through Dijkstra's algorithm was calculated (Figure 1). Then the Betweenness value of internal node in these paths was counted. 385 genes whose Betweenness value over 0 were gained, and these genes were listed out in the Supplementary Table 2. Permutation test was employed to check and calculate their permutation FDR in terms of further selection of these genes, similarly the results showed in the Supplementary Table 2.