Author
Listed:
- Feng Xu
(LKS Faculty of Medicine, The University of Hong Kong
Shenzhen Institute of Research and Innovation, The University of Hong Kong)
- Weixin Wang
(LKS Faculty of Medicine, The University of Hong Kong
Shenzhen Institute of Research and Innovation, The University of Hong Kong)
- Panwen Wang
(LKS Faculty of Medicine, The University of Hong Kong
Shenzhen Institute of Research and Innovation, The University of Hong Kong)
- Mulin Jun Li
(LKS Faculty of Medicine, The University of Hong Kong
Shenzhen Institute of Research and Innovation, The University of Hong Kong)
- Pak Chung Sham
(Centre for Genomic Sciences, LKS Faculty of Medicine, The University of Hong Kong
LKS Faculty of Medicine, The University of Hong Kong
State Key Laboratory in Cognitive and Brain Sciences, The University of Hong Kong)
- Junwen Wang
(LKS Faculty of Medicine, The University of Hong Kong
Shenzhen Institute of Research and Innovation, The University of Hong Kong
Centre for Genomic Sciences, LKS Faculty of Medicine, The University of Hong Kong
HKU-BGI Bioinformatics Algorithms and Core Technology Research Laboratory, The University of Hong Kong)
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.
Suggested Citation
Feng Xu & Weixin Wang & Panwen Wang & Mulin Jun Li & Pak Chung Sham & Junwen Wang, 2012.
"A fast and accurate SNP detection algorithm for next-generation sequencing data,"
Nature Communications, Nature, vol. 3(1), pages 1-9, January.
Handle:
RePEc:nat:natcom:v:3:y:2012:i:1:d:10.1038_ncomms2256
DOI: 10.1038/ncomms2256
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:nat:natcom:v:3:y:2012:i:1:d:10.1038_ncomms2256. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.nature.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.