Evidence map›Paper›PMID 27688796›Full record

ArticleAlgorithms for molecular biology : AMB2016

Analysis of gene copy number changes in tumor phylogenetics.

Jun Zhou, Yu Lin, Vaibhav Rajan, William Hoskins, Bing Feng, Jijun Tang

Open access · goldAbstract read
In one paragraph

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

0numbers the graph read from it
0cells of the map it votes in
3citing papers in PubMed
1.2field-weighted citation impact, top 16% 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

3 citing papers in PubMed, 6 citations in OpenAlex.

  1. Article
  2. Article
  3. 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

6 authors at 3 institutions in 3 countries.

Jun ZhouSchool of Computer Science and Technology, Tianjin University, Tianjin, 300072 China ; Department of Computer Science and Engineering, University of South Carolina, Columbia, SC 29208 USA.
Yu LinResearch School of Computer Science, Australian National University, Canberra, ACT 0200 Australia.
Vaibhav RajanXerox Research Centre India (XRCI), Bangalore, India.
William HoskinsDepartment of Computer Science and Engineering, University of South Carolina, Columbia, SC 29208 USA.
Bing FengDepartment of Computer Science and Engineering, University of South Carolina, Columbia, SC 29208 USA.
Jijun TangDepartment of Computer Science and Engineering, University of South Carolina, Columbia, SC 29208 USA.
University of South Carolina · USAustralian National University · AUTianjin University of Science and Technology · CN

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgoundEvolution of cancer cells is characterized by large scale and rapid changes in the chromosomal  landscape. The fluorescence in situ hybridization (FISH) technique provides a way to measure the copy numbers of preselected genes in a group of cells and has been found to be a reliable source of data to model the evolution of tumor cells. Chowdhury et al. (Bioinformatics 29(13):189-98, 23; PLoS Comput Biol 10(7):1003740, 24) recently develop a computational model for tumor progression driven by gains and losses in cell count patterns obtained by FISH probes. Their model aims to find the rectilinear Steiner minimum tree (RSMT) (Chowdhury et al. in Bioinformatics 29(13):189-98, 23) and the duplication Steiner minimum tree (DSMT) (Chowdhury et al. in PLoS Comput Biol 10(7):1003740, 24) that describe the progression of FISH cell count patterns over its branches in a parsimonious manner. Both the RSMT and DSMT problems are NP-hard and heuristics are required to solve the problems efficiently.

methodsIn this paper we propose two approaches to solve the RSMT problem, one inspired by iterative methods to address the "small phylogeny" problem (Sankoff et al. in J Mol Evol 7(2):133-49, 27; Blanchette et al. in Genome Inform 8:25-34, 28), and the other based on maximum parsimony phylogeny inference. We further show how to extend these heuristics to obtain solutions to the DSMT problem, that models large scale duplication events.

resultsExperimental results from both simulated and real tumor data show that our methods outperform previous heuristics (Chowdhury et al. in Bioinformatics 29(13):189-98, 23; Chowdhury et al. in PLoS Comput Biol 10(7):1003740, 24) in obtaining solutions to both RSMT and DSMT problems.

conclusionThe methods introduced here are able to provide more parsimony phylogenies compared to earlier ones which are consider better choices.

Indexed as

Chromosomal duplicationFISHGene copy numberGene duplicationMaximum parsimonyRectilinear Steiner minimum treeTumor phylogenyWhole genome duplication

Identifiers

PMID27688796
PMCPMC5034472
OpenAlexW2522536125

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.