AI summary · arXiv: 1704.08544v1 · q-bio.GN

Network-based coverage of mutational profiles reveals cancer genes

Borislav H. Hristov, Mona Singh

Original paper · DOI Submitted to arXiv on 26 Apr. 2017 RECOMB 2017 License: NONEXCLUSIVE-DISTRIB 1.0

The essentials

  • Identifying specific genetic alterations in cancer genomics is a main objective
  • Extensive heterogeneity observed in mutational profiles across cancer genomes
  • Individual genomes exhibit numerous alterations, with only a few genes commonly mutated
  • Frequently and infrequently mutated genes both play important roles in cancer development
  • Novel method introduced that considers individual mutational profiles within protein-protein interaction networks
  • Aims to identify small connected subnetworks of genes that collectively contribute to perturbed pathways across individuals
  • Objective function balances identifying a small subset of genes and covering a significant proportion of individuals
  • Solved using integer linear programming and developed a fast heuristic algorithm for practical use
  • Method called nCOP outperformed methods without network information and state-of-the-art network-based methods in large-scale analysis on 6,038 tumor samples from 24 different cancer types obtained from TCGA
  • Combining per-individual mutational information with interaction networks uncovers functionally relevant genes, particularly those less frequently mutated
  • Study contributes to understanding cancer genetics by providing an effective approach for identifying cancer genes based on their impact on biological pathways rather than solely relying on individual gene mutation frequencies.

Key points written by AI: they may contain errors, check them against the paper.

AI-generated keywords: Cancer Genomics Mutational Profiles Protein-Protein Interaction Networks nCOP TCGA

Read further

  • Comprehensive Summary
  • Layman's Summary
  • Blog article
  • Original abstract
In the field of cancer genomics, one of the main objectives is to identify the specific genetic alterations that drive tumor initiation and progression. However, this task is particularly challenging due to the extensive heterogeneity observed in mutational profiles across cancer genomes. Each individual's genome exhibits numerous alterations, with only a few genes being commonly mutated among different individuals. Additionally, both frequently and infrequently mutated genes play important roles in cancer development. To address these challenges, researchers have introduced a novel method that takes into account individual mutational profiles within the context of protein-protein interaction networks. This approach aims to identify small connected subnetworks of genes that may not be frequently mutated individually but collectively contribute to perturbed pathways across a large fraction of individuals. The researchers devised an objective function that strikes a balance between identifying a small subset of genes and covering a significant proportion of individuals. They solved this problem using integer linear programming and also developed a fast heuristic algorithm that performs well in practice. To evaluate their method, called nCOP, the researchers conducted a large-scale analysis on 6,038 tumor samples from 24 different cancer types obtained from The Cancer Genome Atlas (TCGA). Their results demonstrated that nCOP outperformed methods that did not utilize network information as well as state-of-the-art network-based methods that aggregated mutational information across individuals. This highlights the power of combining per-individual mutational information with interaction networks to uncover functionally relevant genes in cancers, particularly those that are less frequently mutated. Overall, this study contributes to our understanding of cancer genetics by providing an effective approach for identifying cancer genes based on their impact on biological pathways rather than solely relying on individual gene mutation frequencies.

Was this synthesis useful?

Score: 0

Why do we need votes?

Votes are used to determine whether we need to re-run our summarizing tools. If the count reaches -10, our tools can be restarted.

Ask questions about this paper to our AI assistant

Compare with the PDF

You can also chat with multiple papers at once here.

⚠The license of the paper does not allow us to build upon its content and the AI assistant only knows about the paper metadata rather than the full article.

Figures and plots

Ask about a figure by number or use its question button to request visual analysis. Up to two figures and four image panels per question. Values read from plots are approximate; check the original data.

AI assistant instructions?

Tools for this paper

Explain it differently 3 free rewrites left today
Save to a collection Group papers in collections to compare them, chat with them and export them. Create a free account Log in

Advanced tools Premium

For researchers who follow a field closely: citation alerts, journal-club slides, version comparison and Zotero export. Discover Premium

Zotero
Citation alerts
Journal club Premium+ Slides to present it
Talk about it in public Premium+ Press kit: release, questions, hype check

Similar papers summarized with our AI tools

Navigate through even more similar papers through a

tree representation

The previous summary was created more than a year ago and can be re-run (if necessary) by clicking on the Run button below.

⚠The license of this specific paper does not allow us to build upon its content and the summarizing tools will be run using the paper metadata rather than the full article. However, it still does a good job, and you can also try our tools on papers with more open licenses.

Disclaimer: The AI-based summarization tool and virtual assistant provided on this website may not always provide accurate and complete summaries or responses. We encourage you to carefully review and evaluate the generated content to ensure its quality and relevance to your needs.