Evidence map›Paper›PMID 27773988›Full record

ArticleCancer informatics2016

A Novel Graph-based Algorithm to Infer Recurrent Copy Number Variations in Cancer.

Chen Chi, Rasif Ajwad, Qin Kuang, Pingzhao Hu

Abstract read
In one paragraph

Article in Cancer informatics, 2016. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
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

1 citing paper in PubMed.

  1. 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

4 authors.

Chen ChiDepartment of Biochemistry and Medical Genetics, University of Manitoba, Winnipeg, Canada; Centre for Healthcare Innovation, Winnipeg Regional Health Authority/University of Manitoba, Winnipeg, Canada.
Rasif AjwadDepartment of Biochemistry and Medical Genetics, University of Manitoba, Winnipeg, Canada; Department of Computer Science, University of Manitoba, Winnipeg, Canada.
Qin KuangDepartment of Biochemistry and Medical Genetics, University of Manitoba, Winnipeg, Canada.
Pingzhao HuDepartment of Biochemistry and Medical Genetics, University of Manitoba, Winnipeg, Canada; Centre for Healthcare Innovation, Winnipeg Regional Health Authority/University of Manitoba, Winnipeg, Canada; Department of Electrical and Computer Engineering, University of Manitoba, Winnipeg, Canada.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Many cancers have been linked to copy number variations (CNVs) in the genomic DNA. Although there are existing methods to analyze CNVs from individual samples, cancer-causing genes are more frequently discovered in regions where CNVs are common among tumor samples, also known as recurrent CNVs. Integrating multiple samples and locating recurrent CNV regions remain a challenge, both computationally and conceptually. We propose a new graph-based algorithm for identifying recurrent CNVs using the maximal clique detection technique. The algorithm has an optimal solution, which means all maximal cliques can be identified, and guarantees that the identified CNV regions are the most frequent and that the minimal regions have been delineated among tumor samples. The algorithm has successfully been applied to analyze a large cohort of breast cancer samples and identified some breast cancer-associated genes and pathways.

Indexed as

cancerinterval graphmaximal cliquerecurrent copy number variation

Identifiers

PMID27773988
PMCPMC5063805

What OpenQuestion holds

Textmetadata
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.