The screening and ranking algorithm to detect DNA copy number variations

From MaRDI portal
Publication:714382

DOI10.1214/12-AOAS539zbMATH Open1401.92145arXiv1210.0345OpenAlexW2033695946MaRDI QIDQ714382FDOQ714382


Authors: Heping Zhang, Yue Selena Niu Edit this on Wikidata


Publication date: 21 October 2012

Published in: The Annals of Applied Statistics (Search for Journal in Brave)

Abstract: DNA Copy number variation (CNV) has recently gained considerable interest as a source of genetic variation that likely influences phenotypic differences. Many statistical and computational methods have been proposed and applied to detect CNVs based on data that generated by genome analysis platforms. However, most algorithms are computationally intensive with complexity at least O(n2), where n is the number of probes in the experiments. Moreover, the theoretical properties of those existing methods are not well understood. A faster and better characterized algorithm is desirable for the ultra high throughput data. In this study, we propose the Screening and Ranking algorithm (SaRa) which can detect CNVs fast and accurately with complexity down to O(n). In addition, we characterize theoretical properties and present numerical analysis for our algorithm.


Full work available at URL: https://arxiv.org/abs/1210.0345




Recommendations




Cites Work


Cited In (43)

Uses Software





This page was built for publication: The screening and ranking algorithm to detect DNA copy number variations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714382)