2016
DOI: 10.1101/gr.211201.116
|View full text |Cite
|
Sign up to set email alerts
|

Identification of complex genomic rearrangements in cancers using CouGaR

Abstract: The genomic alterations associated with cancers are numerous and varied, involving both isolated and large-scale complex genomic rearrangements (CGRs). Although the underlying mechanisms are not well understood, CGRs have been implicated in tumorigenesis. Here, we introduce CouGaR, a novel method for characterizing the genomic structure of amplified CGRs, leveraging both depth of coverage (DOC) and discordant pair-end mapping techniques. We applied our method to whole-genome sequencing (WGS) samples from The C… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
28
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 30 publications
(28 citation statements)
references
References 51 publications
0
28
0
Order By: Relevance
“…We reformulate Problem 1 of finding a proper derived genome G from the measurement data as a graph-theoretic problem. First, we define the diploid interval adjacency graph (DIAG), which can be viewed as a generalization of a breakpoint graph used in the area of comparative genomics [1,65,3], or graphs used in the area of structural analysis of normal and cancer genomes with haploid reference structure [36,42,32,12,15,35]. A DIAG G(R, É A N ) = (V , E) is constructed on a set {1, 2, … , m} of segments, and a set A = A(R) ‰ H( É A N ) of adjacencies.…”
Section: Diploid Interval Adjacency Graphmentioning
confidence: 99%
“…We reformulate Problem 1 of finding a proper derived genome G from the measurement data as a graph-theoretic problem. First, we define the diploid interval adjacency graph (DIAG), which can be viewed as a generalization of a breakpoint graph used in the area of comparative genomics [1,65,3], or graphs used in the area of structural analysis of normal and cancer genomes with haploid reference structure [36,42,32,12,15,35]. A DIAG G(R, É A N ) = (V , E) is constructed on a set {1, 2, … , m} of segments, and a set A = A(R) ‰ H( É A N ) of adjacencies.…”
Section: Diploid Interval Adjacency Graphmentioning
confidence: 99%
“…We picked the seed intervals using the ReadDepth as described on Online methods section 1. 18 . We downsampled the bam files to coverage between 4X-7X by selecting read pairs with specific read group identifiers.…”
Section: ) Samples Reported By Other Studiesmentioning
confidence: 99%
“…Traditional structural variant (SV) analyses cannot decipher complex rearrangements [10][11][12][13] . The few methods that extend the analysis, chain together breakpoints into paths and cycles, but often do not reconstruct the amplicon in the specific region of interest, and do not provide a comprehensive view of alternative structures [14][15][16][17][18][19] . Reconstruction remains challenging due to extreme variability in copy counts (5X-200X) and sizes (100kbp-25Mbp) of amplicons, samples containing heterogeneous mixture of multiple amplicon structures, and inaccuracy of SV identification.…”
mentioning
confidence: 99%
“…Here we consider the problem of inferring sequential structure of rearranged linear/circular chromosomes in a cancer genome given its karyotype graph representation. In previous studies either general observations about necessary and sufficient conditions on the karyotype graphs structure for the existence of the underlying cancer genome [17,1], or attempts at extracting information about specific local rearranged structures (e.g., amplicons, complex rearrangements, etc) [3,16,4] were made. In the present study we formulate a Eulerian Decomposition Problem (EDP) for a cancer karyotype graph with the objective of finding a covering collection of linear and/or circular paths/cycles (i.e., chromosomes).…”
Section: Introductionmentioning
confidence: 99%