2005
DOI: 10.1093/bioinformatics/bti611
|View full text |Cite
|
Sign up to set email alerts
|

Comparative analysis of algorithms for identifying amplifications and deletions in array CGH data

Abstract: We compare 11 different algorithms for analyzing array CGH data. These include both segment detection methods and smoothing methods, based on diverse techniques such as mixture models, Hidden Markov Models, maximum likelihood, regression, wavelets and genetic algorithms. We compute the Receiver Operating Characteristic (ROC) curves using simulated data to quantify sensitivity and specificity for various levels of signal-to-noise ratio and different sizes of abnormalities. We also characterize their performance… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

18
384
0
1

Year Published

2005
2005
2014
2014

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 348 publications
(403 citation statements)
references
References 35 publications
18
384
0
1
Order By: Relevance
“…Different calling algorithms may give different results for an array experiment, and this has been comprehensively discussed [Lai et al, 2005;Pinto et al, 2011]. The sensitivity and specificity are influenced considerably by the choice of the log R-ratio-calling threshold cutoff values for discriminating deletions and duplications from normal diploid copy number.…”
Section: Determination Of Specificity and Sensitivitymentioning
confidence: 99%
See 1 more Smart Citation
“…Different calling algorithms may give different results for an array experiment, and this has been comprehensively discussed [Lai et al, 2005;Pinto et al, 2011]. The sensitivity and specificity are influenced considerably by the choice of the log R-ratio-calling threshold cutoff values for discriminating deletions and duplications from normal diploid copy number.…”
Section: Determination Of Specificity and Sensitivitymentioning
confidence: 99%
“…Circular binary segmentation is one commonly used segmentation algorithm, which divides regions into segments of similar deviation from log 2 ratio of zero [Olshen et al, 2004;Venkatraman and Olshen, 2007]. Analysts should be aware that different algorithms may produce different array results [Lai et al, 2005;Pinto et al, 2011]. Using multiple different calling algorithms can increase confidence, and they may complement each other.…”
Section: Analysis and Interpretation Quality Criteriamentioning
confidence: 99%
“…Use of segmentation algorithms, e.g., CBS (Venkatraman and Olshen, 2007), to identify breakpoints delineating regions with a joint underlying genomic state was early adopted for aCGH data and has been repeatedly evaluated (Lai et al, 2005). Segmentation-based approaches can be applied with the overall aim to describe the studied genome as a series of segments ascribed specific BAF and LLR states.…”
Section: Delineating Regions Of Genomic Imbalancementioning
confidence: 99%
“…The most ideal case, which is considered first, is equivalent to assuming B = 0 in Eq. (10). How to determine the parameters will be described in the next section.…”
Section: Heterogeneity In Ploidy Numbermentioning
confidence: 99%