Department of Industrial Engineering, Ajou University, 206, World cup-ro, Yeongtong-gu, Suwon-si, Gyeonggi-do, 16499, Republic of Korea.
Department of Psychiatry, Ajou University School of Medicine, 206, World cup-ro, Yeongtong-gu, Suwon-si, Gyeonggi-do, 16499, Republic of Korea.
BMC Bioinformatics. 2019 Feb 13;20(1):74. doi: 10.1186/s12859-019-2638-3.
Biomarker discovery studies have been moving the focus from a single target gene to a set of target genes. However, the number of target genes in a drug should be minimum to avoid drug side-effect or toxicity. But still, the set of target genes should effectively block all possible paths of disease progression.
In this article, we propose a network based computational analysis for target gene identification for multi-target drugs. The min-cut algorithm is employed to cut all the paths from onset genes to apoptotic genes on a disease pathway. If the pathway network is completely disconnected, development of disease will not further go on. The genes corresponding to the end points of the cutting edges are identified as candidate target genes for a multi-target drug.
The proposed method was applied to 10 disease pathways. In total, thirty candidate genes were suggested. The result was validated with gene set enrichment analysis software, PubMed literature review and de facto drug targets.
生物标志物发现研究已经将重点从单个靶标基因转移到一组靶标基因。然而,药物的靶标基因数量应该最少,以避免药物副作用或毒性。但是,靶标基因的集合仍应有效地阻断疾病进展的所有可能途径。
在本文中,我们提出了一种基于网络的计算分析方法,用于确定多靶药物的靶基因。采用最小割算法切断疾病途径上起始基因到凋亡基因的所有路径。如果通路网络完全断开,则疾病的发展将不会进一步进行。将与切割边缘的终点相对应的基因鉴定为多靶药物的候选靶基因。
该方法应用于 10 条疾病通路,共提出 30 个候选基因。该结果通过基因集富集分析软件、PubMed 文献回顾和实际药物靶标进行了验证。