Evidence map›Paper›PMID 28515774›Full record

ArticleAlgorithms for molecular biology : AMB2017

Complexity and algorithms for copy-number evolution problems.

Mohammed El-Kebir, Benjamin J Raphael, Ron Shamir, Roded Sharan, Simone Zaccaria, Meirav Zehavi, Ron Zeira

Open access · goldAbstract read
In one paragraph

Article in Algorithms for molecular biology : AMB, 2017. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 24 papers.

0numbers the graph read from it
0cells of the map it votes in
24citing papers in PubMed
1.7field-weighted citation impact, top 17% of its field
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

24 citing papers in PubMed, 47 citations in OpenAlex.

  1. Trial
  2. Article
  3. Article
  4. Review
  5. Article
  6. Article
  7. Review
  8. Article
  9. Article
  10. A zero-agnostic model for copy number evolution in cancer.bioRxiv : the preprint server for biology · 2023
    Article
  11. Article
  12. Article
  13. Parsimonious Clone Tree Integration in cancer.Algorithms for molecular biology : AMB · 2022
    Article
  14. Article
  15. Article
  16. Article
  17. Article
  18. Article
  19. Copy number evolution with weighted aberrations in cancer.Bioinformatics (Oxford, England) · 2020
    Article
  20. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

7 authors at 3 institutions in 3 countries.

Mohammed El-KebirDepartment of Computer Science, Princeton University, Princeton, NJ 08540 USA.
Benjamin J RaphaelDepartment of Computer Science, Princeton University, Princeton, NJ 08540 USA.
Ron ShamirSchool of Computer Science, Tel Aviv University, Tel Aviv, Israel.
Roded SharanSchool of Computer Science, Tel Aviv University, Tel Aviv, Israel.
Simone ZaccariaDepartment of Computer Science, Princeton University, Princeton, NJ 08540 USA.
Meirav ZehaviSchool of Computer Science, Tel Aviv University, Tel Aviv, Israel.
Ron ZeiraSchool of Computer Science, Tel Aviv University, Tel Aviv, Israel.
Tel Aviv University · ILPrinceton University · USUniversity of Milano-Bicocca · IT

Funding

Computational Approaches for Structural Variation Studies in GenomesR01HG005690 · NHGRI · BROWN UNIVERSITY · PI RAPHAEL, BENJAMIN · 2011 to 2015
$2.4M
NHGRI NIH HHS R01 HG005690
6 · The paper itself

Abstract

backgroundCancer is an evolutionary process characterized by the accumulation of somatic mutations in a population of cells that form a tumor. One frequent type of mutations is copy number aberrations, which alter the number of copies of genomic regions. The number of copies of each position along a chromosome constitutes the chromosome's copy-number profile. Understanding how such profiles evolve in cancer can assist in both diagnosis and prognosis.

resultsWe model the evolution of a tumor by segmental deletions and amplifications, and gauge distance from profile [Formula: see text] to [Formula: see text] by the minimum number of events needed to transform [Formula: see text] into [Formula: see text]. Given two profiles, our first problem aims to find a parental profile that minimizes the sum of distances to its children. Given

conclusionsFor the former problem we give a pseudo-polynomial dynamic programming algorithm that is linear in the profile length, and an integer linear program formulation. For the latter problem we show it is NP-hard and give an integer linear program formulation that scales to practical problem instance sizes. We assess the efficiency and quality of our algorithms on simulated instances. AVAILABILITY: https://github.com/raphael-group/CNT-ILP.

Indexed as

CancerCopy-number variantMaximum parsimonyPhylogenySomatic mutation

Identifiers

PMID28515774
PMCPMC5433102
OpenAlexW2614716373

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.