Efficient algorithms to discover alterations with complementary functional association in cancer.
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 b...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Public Library of Science (PLoS)
2019-05-01
|
| Series: | PLoS Computational Biology |
| Online Access: | https://doi.org/10.1371/journal.pcbi.1006802 |
| _version_ | 1830177446315425792 |
|---|---|
| author | Rebecca Sarto Basso Dorit S Hochbaum Fabio Vandin |
| author_facet | Rebecca Sarto Basso Dorit S Hochbaum Fabio Vandin |
| author_sort | Rebecca Sarto Basso |
| collection | DOAJ |
| description | 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: https://github.com/VandinLab/UNCOVER. |
| first_indexed | 2024-12-17T19:24:16Z |
| format | Article |
| id | doaj.art-334006067e1746d599df446a5693c935 |
| institution | Directory Open Access Journal |
| issn | 1553-734X 1553-7358 |
| language | English |
| last_indexed | 2024-12-17T19:24:16Z |
| publishDate | 2019-05-01 |
| publisher | Public Library of Science (PLoS) |
| record_format | Article |
| series | PLoS Computational Biology |
| spelling | doaj.art-334006067e1746d599df446a5693c9352022-12-21T21:35:25ZengPublic Library of Science (PLoS)PLoS Computational Biology1553-734X1553-73582019-05-01155e100680210.1371/journal.pcbi.1006802Efficient algorithms to discover alterations with complementary functional association in cancer.Rebecca Sarto BassoDorit S HochbaumFabio VandinRecent 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: https://github.com/VandinLab/UNCOVER.https://doi.org/10.1371/journal.pcbi.1006802 |
| spellingShingle | Rebecca Sarto Basso Dorit S Hochbaum Fabio Vandin Efficient algorithms to discover alterations with complementary functional association in cancer. PLoS Computational Biology |
| title | Efficient algorithms to discover alterations with complementary functional association in cancer. |
| title_full | Efficient algorithms to discover alterations with complementary functional association in cancer. |
| title_fullStr | Efficient algorithms to discover alterations with complementary functional association in cancer. |
| title_full_unstemmed | Efficient algorithms to discover alterations with complementary functional association in cancer. |
| title_short | Efficient algorithms to discover alterations with complementary functional association in cancer. |
| title_sort | efficient algorithms to discover alterations with complementary functional association in cancer |
| url | https://doi.org/10.1371/journal.pcbi.1006802 |
| work_keys_str_mv | AT rebeccasartobasso efficientalgorithmstodiscoveralterationswithcomplementaryfunctionalassociationincancer AT doritshochbaum efficientalgorithmstodiscoveralterationswithcomplementaryfunctionalassociationincancer AT fabiovandin efficientalgorithmstodiscoveralterationswithcomplementaryfunctionalassociationincancer |