KMC — K-mer Counter is a utility designed for counting k-mers (sequences of consecutive k symbols) in a set of reads from genome sequencing projects. K-mer counting is important for many bioinformatics applications, e.g., developing de Bruijn graph assemblers. Building de Bruijn graphs is a commonly used approach for genome assembly with data from second-generation sequencer. Unfortunately, sequencing errors (frequent in practice) results in huge memory requirements for de Bruijn graphs, as well as long build time. One of the popular approaches to handle this problem is filtering the input reads in such a way that unique k-mers (very likely obtained as a result of an error) are discarded. Thus, KMC scans the raw reads and produces a compact representation of all non-unique reads accompanied with number of their occurrences. The algorithm implemented in KMC makes use mostly of disk space rather than RAM, which allows to use KMC even on rather typical personal computers. When run at high-end server (what is necessary for KMC competitors) it outperforms them in both memory requirements and speed of computation. The disk space necessary for computation is in order of the size of input data (usually it is smaller).
Keywords for this software
References in zbMATH (referenced in 5 articles )
Showing results 1 to 5 of 5.
- Liu, Wen-li; Wu, Qing-biao: Analysis method and algorithm design of biological sequence problem based on generalized k-mer vector (2021)
- Kuhnle, Alan; Mun, Taher; Boucher, Christina; Gagie, Travis; Langmead, Ben; Manzini, Giovanni: Efficient construction of a complete index for pan-genomics read alignment (2019)
- Pellegrina, Leonardo; Pizzi, Cinzia; Vandin, Fabio: Fast approximation of frequent (k)-mers and applications to metagenomics (2019)
- Almodaresi, Fatemeh; Pandey, Prashant; Patro, Rob: Rainbowfish: a succinct colored de Bruijn graph representation (2017)
- Farkaš, Tomáš; Kubán, Peter; Lucká, Mária: Effective parallel multicore-optimized (k)-mers counting algorithm (2016)