ArticleBMC bioinformatics2012
Reconstructing cancer genomes from paired-end sequencing data.
Article in BMC bioinformatics, 2012. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 19 papers.
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.
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.
Who cites it
19 citing papers in PubMed.
- Article
- Distinct Classes of Complex Structural Variation Uncovered across Thousands of Cancer Genome Graphs.Cell · 2020Article
- Reconstruction of clone- and haplotype-specific cancer genome karyotypes from bulk tumor samples.Genome research · 2020Article
- A pipeline for complete characterization of complex germline rearrangements from long DNA reads.Genome medicine · 2020Article
- Copy number evolution with weighted aberrations in cancer.Bioinformatics (Oxford, England) · 2020Article
- Recovering rearranged cancer chromosomes from karyotype graphs.BMC bioinformatics · 2019Article
- Exploring the landscape of focal amplifications in cancer using AmpliconArchitect.Nature communications · 2019Article
- Phylogenetic Copy-Number Factorization of Multiple Tumor Samples.Journal of computational biology : a journal of computational molecular cell biology · 2018Article
- Toward Recovering Allele-specific Cancer Genome Graphs.Journal of computational biology : a journal of computational molecular cell biology · 2018Article
- Identifying simultaneous rearrangements in cancer genomes.Bioinformatics (Oxford, England) · 2018Article
- Reconstructing cancer karyotypes from short read data: the half empty and half full glass.BMC bioinformatics · 2017Article
- ReMixT: clone-specific genomic structure estimation in cancer.Genome biology · 2017Article
- Identification of complex genomic rearrangements in cancers using CouGaR.Genome research · 2017Article
- Allele-Specific Quantification of Structural Variations in Cancer Genomes.Cell systems · 2016Article
- SV-Bay: structural variant detection in cancer genomes using a Bayesian approach with correction for GC-content and read mappability.Bioinformatics (Oxford, England) · 2016Article
- Inferring the global structure of chromosomes from structural variations.BMC genomics · 2015Article
- Expanding the computational toolbox for mining cancer genomes.Nature reviews. Genetics · 2014Review
- DB2: a probabilistic approach for accurate detection of tandem duplication breakpoints using paired-end reads.BMC genomics · 2014Article
- THetA: inferring intra-tumor heterogeneity from high-throughput DNA sequencing data.Genome biology · 2013Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
5 authors.
Funding
Abstract
backgroundA cancer genome is derived from the germline genome through a series of somatic mutations. Somatic structural variants - including duplications, deletions, inversions, translocations, and other rearrangements - result in a cancer genome that is a scrambling of intervals, or "blocks" of the germline genome sequence. We present an efficient algorithm for reconstructing the block organization of a cancer genome from paired-end DNA sequencing data.
resultsBy aligning paired reads from a cancer genome - and a matched germline genome, if available - to the human reference genome, we derive: (i) a partition of the reference genome into intervals; (ii) adjacencies between these intervals in the cancer genome; (iii) an estimated copy number for each interval. We formulate the Copy Number and Adjacency Genome Reconstruction Problem of determining the cancer genome as a sequence of the derived intervals that is consistent with the measured adjacencies and copy numbers. We design an efficient algorithm, called Paired-end Reconstruction of Genome Organization (PREGO), to solve this problem by reducing it to an optimization problem on an interval-adjacency graph constructed from the data. The solution to the optimization problem results in an Eulerian graph, containing an alternating Eulerian tour that corresponds to a cancer genome that is consistent with the sequencing data. We apply our algorithm to five ovarian cancer genomes that were sequenced as part of The Cancer Genome Atlas. We identify numerous rearrangements, or structural variants, in these genomes, analyze reciprocal vs. non-reciprocal rearrangements, and identify rearrangements consistent with known mechanisms of duplication such as tandem duplications and breakage/fusion/bridge (B/F/B) cycles.
conclusionsWe demonstrate that PREGO efficiently identifies complex and biologically relevant rearrangements in cancer genome sequencing data. An implementation of the PREGO algorithm is available at http://compbio.cs.brown.edu/software/.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
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.