Disk-based k-mer counting on a PC

BMC Bioinformatics

Volumn 14, Issue 1, 2013, Pages

  Deorowicz, Sebastian ^a   Debudaj Grabysz, Agnieszka ^a   Grabowski, Szymon ^b  

^a SILESIAN UNIVERSITY OF TECHNOLOGY   (Poland)

^b LODZ UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

De Bruijn graph genome assemblers; K mer counting; Multiple sequence alignment; Repeat detection

Indexed keywords

BIOINFORMATICS APPLICATIONS; COMPETITIVE ALGORITHMS; COUNTING PROBLEMS; DE BRUIJN GRAPHS; DISK-BASED ALGORITHM; K-MER COUNTING; MULTIPLE SEQUENCE ALIGNMENTS; RESOURCE MANAGEMENT;

ALGORITHMS; BIOINFORMATICS; GENES; MAMMALS; PERSONAL COMPUTERS;

RANDOM ACCESS STORAGE;

MAMMALIA;

ALGORITHM; ANIMAL; ARTICLE; CAENORHABDITIS ELEGANS; COMPUTER PROGRAM; DNA SEQUENCE; GENETICS; GENOMICS; HUMAN; HUMAN GENOME; METHODOLOGY; MICROCOMPUTER; SEQUENCE ALIGNMENT;

ALGORITHMS; ANIMALS; CAENORHABDITIS ELEGANS; GENOME, HUMAN; GENOMICS; HUMANS; MICROCOMPUTERS; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, DNA; SOFTWARE;

EID: 84879028014     PISSN: None     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/1471-2105-14-160     Document Type: Article

References (11)

1. Compeau PE, Pevzner PA, Tesler G. How to apply de Bruijn graphs to genome assembly. Nature Biotechnol 2011, 29(11):987-991.
2. Edgar RC. MUSCLE: multiple sequence alignment with high accuracy and high throughput. Nucleic Acids Res 2004, 32(5):1792-1797. 10.1093/nar/gkh340, 390337, 15034147.
3. Kurtz S, Narechania A, Stein J, Ware D. A new method to compute K-mer frequencies and its application to annotate large repetitive plant genomes. BMC Genomics 2008, 9(1):517. 10.1186/1471-2164-9-517, 2613927, 18976482.
4. Kelley DR, Schatz MC, Salzberg SL. Quake: quality-aware detection and correction of sequencing errors. Genome Biol 2010, 11(11):R116. 10.1186/gb-2010-11-11-r116, 3156955, 21114842.
5. Miller JR, Delcher AL, Koren S, Venter E, Walenz B, Brownley A, Johnson J, Li K, Mobarry CM, Sutton GG. Aggressive assembly of pyrosequencing reads with mates. Bioinformatics 2008, 24(24):2818-2824. 10.1093/bioinformatics/btn548, 2639302, 18952627.
6. Marçais G, Kingsford C. A fast, lock-free approach for efficient parallel counting of occurrences of k-mers. Bioinformatics 2011, 27(6):764-770. 10.1093/bioinformatics/btr011, 3051319, 21217122.
7. Melsted P, Pritchard JK. Efficient counting of k-mers in DNA sequences using a Bloom Filter. BMC Bioinformatics 2011, 12:333. 10.1186/1471-2105-12-333, 3166945, 21831268.
8. Pell J, Hintze A, Canino-Koning R, Howe A, Tiedje JM, Brown CT. Scaling metagenome sequence assembly with probabilistic de Bruijn graphs. Proc Natl Acad Sci USA 2012, 109(33):13272-13277. 10.1073/pnas.1121464109, 3421212, 22847406.
9. Rizk G, Lavenier D, Chikhi R. DSK: k-mer counting with very low memory usage. Bioinformatics 2013, 29(5):652-653. 10.1093/bioinformatics/btt020, 23325618.
10. Satish N, Kim C, Chhugani J, Nguyen AD, Lee VW, Kim D, Dubey P. Fast Sort on CPUs and GPUs. A Case for Bandwidth Oblivious SIMD Sort. Proceedings of the 2010 International Conference on Management of Data: 6-11 June 2010 2010, 351-362. Indianapolis: ACM.
11. Dean J, Ghemawat S. MapReduce: simplified data processing on large clusters. Commun ACM 2008, 51(1):107-113.