A fast and accurate SNP detection algorithm for next-generation sequencing data

45Citations
Citations of this article
135Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Various methods have been developed for calling single-nucleotide polymorphisms from next-generation sequencing data. However, for satisfactory performance, most of these methods require expensive high-depth sequencing. Here, we propose a fast and accurate single-nucleotide polymorphism detection program that uses a binomial distribution-based algorithm and a mutation probability. We extensively assess this program on normal and cancer next-generation sequencing data from The Cancer Genome Atlas project and pooled data from the 1,000 Genomes Project. We also compare the performance of several state-of-the-art programs for single-nucleotide polymorphism calling and evaluate their pros and cons. We demonstrate that our program is a fast and highly accurate single-nucleotide polymorphism detection method, particularly when the sequence depth is low. The program can finish single-nucleotide polymorphism calling within four hours for 10-fold human genome next-generation sequencing data (30 gigabases) on a standard desktop computer. © 2012 Macmillan Publishers Limited.

Cite

CITATION STYLE

APA

Xu, F., Wang, W., Wang, P., Jun Li, M., Chung Sham, P., & Wang, J. (2012). A fast and accurate SNP detection algorithm for next-generation sequencing data. Nature Communications, 3. https://doi.org/10.1038/ncomms2256

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