Sign in
BioinformaticsbioRxiv
Preprint

K-mer counting with low memory consumption enables fast clustering of single-cell sequencing data without read alignment

Christina Huan ShiiD, Kevin Yuk-Lap YipiD

Abstract

K-mer counting has many applications in sequencing data processing and analysis. However, sequencing errors can produce many false k-mers that substantially increase the memory requirement during counting. We propose a fast k-mer counting method, CQF-deNoise, which has a novel component for dynamically identifying and removing false k-mers while preserving counting accuracy. Compared with four state-of-the-art k-mer counting methods, CQF-deNoise consumed 49-76% less memory than the second best method, but still ran competitively fast. The k-mer counts from CQF-deNoise produced cell clusters from single-cell RNA-seq data highly consistent with CellRanger but required only 5% of the running time at the same memory consumption, suggesting that CQF-deNoise can be used for a preview of cell clusters for an early detection of potential data problems, before running a much more time-consuming full analysis pipeline.

PDFDOI

02 /Specification & Classification

Click any tag to browse matching papers

Reproducibility ledger

Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.

Sign in to file a reproducibility report.

Similarity Map
SelectedSame fieldCross-field
THISPandey '17Lemane '22Melsted '14Hicks '21Melsted '21Shokrof '21
68% semantic matchBioinformatics
Prashant Pandey, Michael A. Bender, Rob Johnson+1 more·Bioinformatics·Oct 6, 2017· 95 citations