arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1604.02467q-bio.QM
收藏

发现与癌症生存相关的突变子网络

Finding Mutated Subnetworks Associated with Survival in Cancer

Tommy Hansen, Fabio Vandin

摘要:

下一代测序技术允许测量来自相同癌症类型的大量患者的体细胞突变。分析这些突变的主要目标之一是鉴定与临床参数(如生存时间)相关的突变。这一目标受到癌症突变的遗传异质性的阻碍,因为基因和突变在通路的背景下起作用。因此,为了确定与生存时间相关的突变,在相互作用网络的背景下研究突变至关重要。在这项工作中,我们研究的问题,确定一个大的基因-基因相互作用网络,与生存相关的突变的子网络。我们正式定义了相关的计算问题,使用分数的子网络的对数秩检验,广泛使用的统计测试比较两个群体的生存的测试统计量的基础上。我们表明,计算问题是NP-难的,我们提出了一种新的算法,称为网络的突变与生存(NoMAS),来解决它。NoMAS是基于颜色编码技术,以前已在其他应用程序中使用,以找到最高得分的子网络具有高概率时,子网络的分数是加性的。在我们的情况下,分数不是加性的;尽管如此,我们证明了在癌症突变的合理模型下,NoMAS确实以高概率确定了最佳解决方案。我们在模拟和癌症数据上测试NoMAS,将其与基于单基因测试的方法和各种贪婪方法进行比较。我们表明,我们的方法确实找到了最优解,并且比其他方法表现得更好。此外,在两个癌症数据集上,我们的方法识别出与生存率显著相关的子网络,而当孤立地考虑时,没有一个基因与生存率显著相关。

英文摘要:

Next-generation sequencing technologies allow the measurement of somatic mutations in a large number of patients from the same cancer type. One of the main goals in analyzing these mutations is the identification of mutations associated with clinical parameters, such as survival time. This goal is hindered by the genetic heterogeneity of mutations in cancer, due to the fact that genes and mutations act in the context of pathways. To identify mutations associated with survival time it is therefore crucial to study mutations in the context of interaction networks. In this work we study the problem of identifying subnetworks of a large gene-gene interaction network that have mutations associated with survival. We formally define the associated computational problem by using a score for subnetworks based on the test statistic of the log-rank test, a widely used statistical test for comparing the survival of two populations. We show that the computational problem is NP-hard and we propose a novel algorithm, called Network of Mutations Associated with Survival (NoMAS), to solve it. NoMAS is based on the color-coding technique, that has been previously used in other applications to find the highest scoring subnetwork with high probability when the subnetwork score is additive. In our case the score is not additive; nonetheless, we prove that under a reasonable model for mutations in cancer NoMAS does identify the optimal solution with high probability. We test NoMAS on simulated and cancer data, comparing it to approaches based on single gene tests and to various greedy approaches. We show that our method does indeed find the optimal solution and performs better than the other approaches. Moreover, on two cancer datasets our method identifies subnetworks with significant association to survival when none of the genes has significant association with survival when considered in isolation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑