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

Detecting copy number variation with mated short reads

Abstract: The development of high-throughput sequencing (HTS) technologies has opened the door to novel methods for detecting copy number variants (CNVs) in the human genome. While in the past CNVs have been detected based on array CGH data, recent studies have shown that depth-of-coverage information from HTS technologies can also be used for the reliable identification of large copy-variable regions. Such methods, however, are hindered by sequencing biases that lead certain regions of the genome to be over-or undersam… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
140
0

Year Published

2011
2011
2019
2019

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 159 publications
(144 citation statements)
references
References 39 publications
0
140
0
Order By: Relevance
“…To correctly identify these events, two additional algorithms must be implemented. The first uses an approach[82] similar to that used for the analysis of array-based Comparative Genomic Hybridizatin (aCGH) data. Bins of a width defined by the user are constructed to span the genome, and the number of aligned reads in each bin is recorded.…”
Section: Massively Parallel Sequencingmentioning
confidence: 99%
“…To correctly identify these events, two additional algorithms must be implemented. The first uses an approach[82] similar to that used for the analysis of array-based Comparative Genomic Hybridizatin (aCGH) data. Bins of a width defined by the user are constructed to span the genome, and the number of aligned reads in each bin is recorded.…”
Section: Massively Parallel Sequencingmentioning
confidence: 99%
“…Also tools exist which combine techniques already during the detection, e.g. inGAPsv [31], CNVer [32], GASVPro [33], SVseq2 [34], or the method by Nord et al [35]. The method presented here is based on paired-end mapping.…”
Section: Introductionmentioning
confidence: 99%
“…To overcome these limitations, we augment the tumor adjacency graph to a network circulation problem (Medvedev et al 2010). For a region e with respective read coverage n e and t e in normal and tumor sample, we reinterpret the convex negative log emission probabilities from our HMM as the cost of flow along the corresponding edge e. For tumor adjacency edges, denoted T E , we assign a constant cost S E (e∈T E ) per unit of flow that reflects the confidence of the edge based on breakpoint mappability.…”
Section: Using Maximum Likelihood For Counting Copiesmentioning
confidence: 99%
“…In this network, a unit of flow corresponds to an additional copy of a genomic region. Edges use a convex flow cost function (Medvedev et al 2010) that equals the negative log emission probabilities from our HMM.…”
Section: Overview Of the Cougar Algorithmmentioning
confidence: 99%
See 1 more Smart Citation