… Hepatocellular carcinoma (HCC) is the most common type of liver cancer worldwide and …
method to identify hepatocellular carcinoma related genes based on k-th shortest paths in the …

… shortest path between these two proteins with Dijkstra’s algorithm (Dijkstra, 1959). The shortest
paths … , meaning that there are at least 145 shortest paths going through this gene. This …

… to analyze gene expression data from hepatocellular carcinomas of varying responsiveness
and … Second, we explore the redundant short paths between the MAPK and Focal Adhesion …

… proteins by searching the shortest paths between them. The … , cirrhotic, and hepatocellular
carcinoma liver tissue samples … to liver cirrhosis and hepatocellular carcinoma classification. …

… Type C hepatitis, as a type of hepatitis, has been reported to induce cirrhosis and hepatocellular
carcinoma within a very short amount of time. It is a great threat to human health. Some …

… Stress centrality is a metric based on the number of nodes in the shortest path between two
other nodes (29). A stressed node was a node traversed by a high number of shortest paths. …

… hepatocellular carcinoma [13]. To link miRNA with human diseases, the Human microRNA
Disease Database (HMDD) curates experiment-supported evidences for human miRNA and …

… The s and t are nodes in the network different from n, σ st indicates the number of shortest
paths from s to t and σ st (n) is the number of shortest paths from s to t that n lies on. …

… Where, d (i, j) is the shortest distance between node i and j. • Stress Centrality: For a node
‘a’, the stress centrality is the number of shortest paths passing through ‘a’. Higher the value of …

… The transformation proteins and HCV target proteins derived from the shortest paths between
cirrhosis and HCC in our study were significantly overlapped with hypergeometric test P …