Discovery of new drug therapeutic indications from gene mutation information for hepatocellular carcinoma

Authors: Liang Yu, Fengdan Xu, Lin Gao

arXiv: 1707.04586v1 - DOI (q-bio.GN)
arXiv admin note: substantial text overlap with arXiv:1707.00954

Abstract: Hepatocellular carcinoma (HCC) is the most common primary liver malignancy and is a leading cause of cancer-related death worldwide. However, cure is not possible with currently used therapies, and there is not so much approved targeted therapy for HCC despite numerous attempts and clinical trials. So, it is essential to identify additional therapeutic strategies to block the growth of HCC tumors. As a cancer disease, it is associated with aberrant genomic and transcriptional landscapes. We sought to use a systematic drug repositioning bioinformatics approach to identify novel candidate drugs to treat HCC, which considers not only aberrant genomic information, but also the changes of transcriptional landscapes. First, we screen the collection of HCC feature genes that frequently mutated in most samples of HCC based on human mutation data. Then, the gene expression data of HCC in TCGA are combined to classify the kernel genes of HCC. Finally, the therapeutic score (TS) of each drug is calculated based on the kolmogorov-smirnov statistical method. Using this strategy, we identified five drugs that associated with HCC, including three drugs that could treat HCC and two drugs that might have side-effect on HCC. In addition, we also make Connectivity Map (CMap) profiles similarity analysis and KEGG enrichment analysis on drug targets. All these findings suggest that our approach is effective for accurate discovering novel therapeutic options for HCC and easily to be extended to other tumors.

Submitted to arXiv on 14 Jul. 2017

Explore the paper tree

Click on the tree nodes to be redirected to a given paper and access their summaries and virtual assistant

Also access our AI generated Summaries, or ask questions about this paper to our AI assistant.

Look for similar papers (in beta version)

By clicking on the button above, our algorithm will scan all papers in our database to find the closest based on the contents of the full papers and not just on metadata. Please note that it only works for papers that we have generated summaries for and you can rerun it from time to time to get a more accurate result while our database grows.