NaiveBayesCall: An efficient model-based base-calling algorithm for high-throughput sequencing

Journal of Computational Biology

Volumn 18, Issue 3, 2011, Pages 365-377

  Kao, Wei Chun ^a   Song, Yun S ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Algorithms; combinatorics; evolution; genome analysis; HMM; machine learning; probability

Indexed keywords

VIRUS DNA;

ALGORITHM; BACTERIOPHAGE PHI X 174; CONFERENCE PAPER; ECONOMICS; GENETICS; HIGH THROUGHPUT SEQUENCING; METHODOLOGY; NUCLEOTIDE SEQUENCE; SINGLE NUCLEOTIDE POLYMORPHISM;

ALGORITHMS; BACTERIOPHAGE PHI X 174; BASE SEQUENCE; DNA, VIRAL; HIGH-THROUGHPUT NUCLEOTIDE SEQUENCING; POLYMORPHISM, SINGLE NUCLEOTIDE;

EID: 79952389116     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2010.0247     Document Type: Conference Paper

References (21)

1. Bentley, D.R. 2006. Whole-genome re-sequencing. Curr. Opin. Genet. Dev. 16, 545-552. (Pubitemid 44738530)
2. Brockman, W., Alvarez, P., Young, S., et al. 2008. Quality scores and SNP detection in sequencing-by-synthesis systems. Genome Res. 18, 763-770. (Pubitemid 351645066)
3. Butler, J., MacCallum, I., Kleber, M., et al. 2008. ALLPATHS: De novo assembly of whole-genome shotgun microreads. Genome Res. 18, 810-820. (Pubitemid 351645071)
4. Chaisson, M.J.P., Brinza, D., and Pevzner, P.A. 2009. De novo fragment assembly with short mate-paired reads: Does the read length matter? Genome Res. 19, 336-346.
5. Erlich, Y., Mitra, P., Delabastide, M., et al. 2008. Alta-Cyclic: A self-optimizing base caller for next-generation sequencing. Nat. Methods, 5, 679-682.
6. Ewing, B., and Green, P. 1998. Base-calling of automated sequencer traces using Phred. II. Error probabilities. Genome Res. 8, 186-194. (Pubitemid 28177230)
7. Hellmann, I., Mang, Y., Gu, Z., et al. 2008. Population genetic analysis of shotgun assemblies of genomic sequences from multiple individuals. Genome Res. 18, 1020-1029. (Pubitemid 351931153)
8. Jiang, R., Tavare, S., and Marjoram, P. 2009. Population genetic inference from resequencing data. Genetics 181, 187-197.
9. Kao, W.C., Stevens, K., and Song, Y.S. 2009. BayesCall: A model-based basecalling algorithm for high-throughput short-read sequencing. Genome Res. 19, 1884-1895.
10. Kiefer, J. 1953. Sequential minimax search for a maximum. Proc. Am. Math. Soc. 4, 502-506.
11. Langmead, B., Trapnell, C., Pop, M., et al. 2009. Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. Genome Biol. 10, R25.
12. Li, H., Ruan, J., and Durbin, R. 2008. Mapping short DNA sequencing reads and calling variants using mapping quality scores. Genome Res. 18, 1851-1858.
13. Li, L., and Speed, T. 1999. An estimate of the crosstalk matrix in four-dye fluorescence-based DNA sequencing. Electrophoresis 20, 1433-1442. (Pubitemid 29299991)
14. Medvedev, P., and Brudno, M. 2008. Ab Initio whole genome shotgun assembly with mated short reads. Lect. Notes Comput. Sci. 4955, 50-64.
15. Metzker, M.L. 2005. Emerging technologies in DNA sequencing. Genome Res. 15, 1767-76. (Pubitemid 41780407)
16. Rougemont, J., Amzallag, A., Iseli, C., et al. 2008. Probabilistic base calling of Solexa sequencing data. BMC Bioinformatics 9, 431.
17. Sundquist, A., Ronaghi, M., Tang, H., et al. 2007. Whole-genome sequencing and assembly with high-throughput, short-read technologies. PLoS One 2, e484.
18. Viterbi, A. 1967. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Trans. Inform. Theory 13, 260-269.
19. Whiteford, N., Skelly, T., Curtis, C., et al. 2009. Swift: Primary data analysis for the Illumina Solexa sequencing platform. Bioinformatics 25, 2194-2199.
20. Yin, Z., Severin, J., Giddings, M.C., et al. 1996. Automatic matrix determination in four dye fluorescence-based DNA sequencing. Electrophoresis 17, 1143-1150. (Pubitemid 26226187)
21. Zerbino, D.R., and Birney, E. 2008. Velvet: Algorithms for de novo short read assembly using de Bruijn graphs. Genome Res. 18, 821-829. (Pubitemid 351645072)