首页> 美国卫生研究院文献>PLoS Computational Biology >Efficient algorithms to discover alterations with complementary functional association in cancer
【2h】

Efficient algorithms to discover alterations with complementary functional association in cancer

机译:有效的算法来发现具有互补功能关联的癌症改变

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Recent large cancer studies have measured somatic alterations in an unprecedented number of tumours. These large datasets allow the identification of cancer-related sets of genetic alterations by identifying relevant combinatorial patterns. Among such patterns, mutual exclusivity has been employed by several recent methods that have shown its effectiveness in characterizing gene sets associated to cancer. Mutual exclusivity arises because of the complementarity, at the functional level, of alterations in genes which are part of a group (e.g., a pathway) performing a given function. The availability of quantitative target profiles, from genetic perturbations or from clinical phenotypes, provides additional information that can be leveraged to improve the identification of cancer related gene sets by discovering groups with complementary functional associations with such targets. In this work we study the problem of finding groups of mutually exclusive alterations associated with a quantitative (functional) target. We propose a combinatorial formulation for the problem, and prove that the associated computational problem is computationally hard. We design two algorithms to solve the problem and implement them in our tool UNCOVER. We provide analytic evidence of the effectiveness of UNCOVER in finding high-quality solutions and show experimentally that UNCOVER finds sets of alterations significantly associated with functional targets in a variety of scenarios. In particular, we show that our algorithms find sets which are better than the ones obtained by the state-of-the-art method, even when sets are evaluated using the statistical score employed by the latter. In addition, our algorithms are much faster than the state-of-the-art, allowing the analysis of large datasets of thousands of target profiles from cancer cell lines. We show that on two such datasets, one from project Achilles and one from the Genomics of Drug Sensitivity in Cancer project, UNCOVER identifies several significant gene sets with complementary functional associations with targets. Software available at: .
机译:最近的大型癌症研究已经测量了前所未有数量的肿瘤中的体细胞变化。这些大型数据集可以通过识别相关的组合模式来识别与癌症相关的基因改变集。在这些模式中,互斥性已被几种最新方法采用,这些方法已显示出其在表征与癌症相关的基因组方面的有效性。互斥性的产生是由于在功能水平上基因的互补性,而这些基因是执行给定功能的一组基因(例如途径)的一部分。来自遗传扰动或临床表型的定量靶标谱的可用性提供了额外的信息,可通过发现与此类靶标具有互补功能关联的基团来利用这些信息来改善对癌症相关基因集的鉴定。在这项工作中,我们研究了寻找与定量(功能)目标相关的互斥变更组的问题。我们提出了该问题的组合公式,并证明了相关的计算问题在计算上是困难的。我们设计了两种算法来解决该问题,并在我们的工具UNCOVER中实现它们。我们提供了UNCOVER在寻找高质量解决方案中的有效性的分析证据,并通过实验证明了UNCOVER在各种情况下都能发现与功能目标显着相关的变更集。尤其是,我们证明了,即使使用后继算法所使用的统计评分对集合进行评估,我们的算法也能找到比通过最新技术方法获得的集合更好的集合。此外,我们的算法比最新技术快得多,可以分析来自癌细胞系的数千个目标概况的大型数据集。我们显示,在两个这样的数据集上,一个来自阿基里斯项目,一个来自癌症药物敏感性基因组学项目,UNCOVER识别了几个具有与靶标互补功能关联的重要基因集。可在以下位置找到软件。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号