Informed and automated k-mer size selection for genome assembly

Bioinformatics

Volumn 30, Issue 1, 2014, Pages 31-37

  Chikhi, Rayan ^a   Medvedev, Paul ^a,b  

^a Department of Computer Science and Engineering ^*  (United States)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ANIMAL; AUTOMATION; DNA SEQUENCE; GENOME; HIGH THROUGHPUT SEQUENCING; HUMAN; INSECT; PROCEDURES; SOFTWARE; STAPHYLOCOCCUS AUREUS; ARTICLE; COMPUTER PROGRAM; METHODOLOGY;

ALGORITHMS; ANIMALS; AUTOMATION; GENOME; HIGH-THROUGHPUT NUCLEOTIDE SEQUENCING; HUMANS; INSECTS; SEQUENCE ANALYSIS, DNA; SOFTWARE; STAPHYLOCOCCUS AUREUS;

EID: 84891349005     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btt310     Document Type: Article

References (20)

1. Alkan, C. et al. (2011) Limitations of next-generation genome sequence assembly. Nat. Methods, 8, 61-65.
2. Bankevich, A. et al. (2013) SPAdes: a new genome assembly algorithm and its applications to single-cell sequencing. J. Comput. Biol., 19, 455-477.
3. Bradnam, K.R. et al. (2013) Assemblathon 2: evaluating de novo methods of genome assembly in three vertebrate species. arXiv preprint arXiv:1301.5406.
4. Chaisson, M.J. and Pevzner, P.A. (2008) Short read fragment assembly of bacterial genomes. Genome Res, 18, 324-330.
5. Chikhi, R. and Rizk, G. (2012) Space-efficient and exact de Bruijn graph representation based on a bloom filter. In: Algorithms in Bioinformatics, Lecture Notes in Computer Science. Vol. 7534, Springer-Verlag Berlin, Heidelberg, pp. 236-248.
6. Chitsaz, H. et al. (2011) Efficient de novo assembly of single-cell bacterial genomes from short-read data sets. Nat. Biotechnol., 29, 915-921.
7. Cormode, G. et al. (2005) Summarizing and mining inverse distributions on data streams via dynamic inverse sampling. In: Proceedings of the 31st international conference on Very large data bases. VLDB Endowment, Norway, pp. 25-36.
8. Earl, D.A. et al. (2011) Assemblathon 1: a competitive assessment of de novo short read assembly methods. Genome Res., 21, 2224-2241.
9. Gurevich, A. et al. (2013) QUAST: quality assessment tool for genome assemblies. Bioinformatics, 29, 1072-1075.
10. Kelley, D.R. et al. (2010) Quake: quality-aware detection and correction of sequencing errors. Genome Biol., 11, R116.
11. Luo, R. et al. (2012) SOAPdenovo2: an empirically improved memory-efficient short-read de novo assembler. GigaScience, 1, 1-6.
12. Marçais, G. and Kingsford, C. (2011) A fast, lock-free approach for efficient parallel counting of occurrences of k-mers. Bioinformatics, 27, 764-770.
13. Peng, Y. et al. (2012) IDBA-UD: a de novo assembler for single-cell and metagenomic sequencing data with highly uneven depth. Bioinformatics, 28, 1420-1428.
14. Pevzner, P.A. et al. (2001) An Eulerian path approach to DNA fragment assembly. Proc. Natl Acad. Sci. USA, 98, 9748-9753.
15. Press, W.H. et al. (2007) Numerical Recipes 3rd Edition: The Art of Scientific Computing. Cambridge University Press, Cambridge.
16. Ribeiro, F. et al. (2012) Finished bacterial genomes from shotgun sequence data. Genome Res., 22, 2270-2277.
17. Rizk, G. et al. (2013) DSK: k-mer counting with very low memory usage. Bioinformatics, 29, 652-653.
18. Salzberg, S.L. et al. (2011) GAGE: a critical evaluation of genome assemblies and assembly algorithms. Genome Res., 22, 557-567.
19. Simpson, J.T. and Durbin, R. (2011) Efficient de novo assembly of large genomes using compressed data structures. Genome Res., 22, 549-556.
20. Zerbino, D.R. and Birney, E. (2008) Velvet: algorithms for de novo short read assembly using de Bruijn graphs. Genome Res., 18, 821-829.