An all-statistics, high-speed algorithm for the analysis of copy number variation in genomes

4Citations
Citations of this article
33Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Detection of copy number variation (CNV) in DNA has recently become an important method for understanding the pathogenesis of cancer. While existing algorithms for extracting CNV from microarray data have worked reasonably well, the trend towards ever larger sample sizes and higher resolution microarrays has vastly increased the challenges they face. Here, we present Segmentation analysis of DNA (SAD), a clustering algorithm constructed with a strategy in which all operational decisions are based on simple and rigorous applications of statistical principles, measurement theory and precise mathematical relations. Compared with existing packages, SAD is simpler in formulation, more user friendly, much faster and less thirsty for memory, offers higher accuracy and supplies quantitative statistics for its predictions. Unique among such algorithms, SAD's running time scales linearly with array size; on a typical modern notebook, it completes high-quality CNV analyses for a 250 thousand-probe array in ∼1s and a 1.8 million-probe array in ∼8s. © 2011 The Author(s).

Cite

CITATION STYLE

APA

Chen, C. H., Lee, H. C., Ling, Q., Chen, H. R., Ko, Y. A., Tsou, T. S., … Lee, H. C. (2011). An all-statistics, high-speed algorithm for the analysis of copy number variation in genomes. Nucleic Acids Research, 39(13). https://doi.org/10.1093/nar/gkr137

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free