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

一种新的癌症突变相关聚类分析方法

A new correlation clustering method for cancer mutation analysis

University of Illinois at Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校);Carnegie Mellon University(卡内基梅隆大学)

Jack P. Hou, Amin Emad, Gregory J. Puleo, Jian Ma, Olgica Milenkovic

摘要:

癌症基因组表现出大量不同的改变,以不同的方式影响许多基因。人们普遍认为,这些改变遵循与潜在的分子相互作用网络和功能途径有很强联系的组合模式。更好地理解突变规则背后的生成机制及其对基因群落的影响对于发现驱动突变的过程以及识别与癌症发展和进展相关的网络模块具有重要意义。我们开发了一种新的方法,癌症突变模式分析的基础上的约束形式的相关聚类。相关聚类是一种不可知的学习方法,可用于一般的社区发现问题,其中社区的数量或其结构是事先不知道的。由此产生的算法,命名为$C^3$,利用突变,患者覆盖范围和驱动网络浓度原则的互斥性;它接受用户确定的异质患者数据的组合作为其输入,例如可从TCGA获得的数据(包括突变,拷贝数和基因表达信息),并创建大量的簇,其中包含特定类型癌症中互斥的突变基因。簇大小可能需要服从一些有用的软大小约束,而不影响算法的计算复杂性。为了测试$C^3$,我们对TCGA乳腺癌和胶质母细胞瘤数据进行了详细分析,并表明我们的算法在发现互斥基因模块和识别驱动基因方面优于最先进的CoMEt方法。我们的$C^3$方法代表了一种独特的工具,可用于在大规模癌症基因组学研究中有效可靠地识别突变模式和驱动途径。

英文摘要:

Cancer genomes exhibit a large number of different alterations that affect many genes in a diverse manner. It is widely believed that these alterations follow combinatorial patterns that have a strong connection with the underlying molecular interaction networks and functional pathways. A better understanding of the generative mechanisms behind the mutation rules and their influence on gene communities is of great importance for the process of driver mutations discovery and for identification of network modules related to cancer development and progression. We developed a new method for cancer mutation pattern analysis based on a constrained form of correlation clustering. Correlation clustering is an agnostic learning method that can be used for general community detection problems in which the number of communities or their structure is not known beforehand. The resulting algorithm, named $C^3$, leverages mutual exclusivity of mutations, patient coverage, and driver network concentration principles; it accepts as its input a user determined combination of heterogeneous patient data, such as that available from TCGA (including mutation, copy number, and gene expression information), and creates a large number of clusters containing mutually exclusive mutated genes in a particular type of cancer. The cluster sizes may be required to obey some useful soft size constraints, without impacting the computational complexity of the algorithm. To test $C^3$, we performed a detailed analysis on TCGA breast cancer and glioblastoma data and showed that our algorithm outperforms the state-of-the-art CoMEt method in terms of discovering mutually exclusive gene modules and identifying driver genes. Our $C^3$ method represents a unique tool for efficient and reliable identification of mutation patterns and driver pathways in large-scale cancer genomics studies.

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

↑