Fast Iteration of Spaced k-mers

📅 2026-03-26
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
This work addresses the inefficiency of traditional methods in extracting spaced k-mers, which struggle to meet the performance demands of modern bioinformatics. For the first time, the study systematically leverages low-level CPU bit-manipulation instructions for spaced k-mer extraction, implementing a concise and highly efficient algorithm in C++20. The approach carefully avoids common implementation pitfalls while significantly optimizing memory access patterns and computational workflows. Evaluated on a single CPU core, the method achieves throughput of up to 750 MB of nucleotide sequences per second—nearly an order of magnitude faster than existing solutions—thereby unifying algorithmic simplicity with high performance.

Technology Category

Application Category

📝 Abstract
We present efficient approaches for extracting spaced k-mers from nucleotide sequences. They are based on bit manipulation instructions at CPU level, making them both simpler to implement and up to an order of magnitude faster than existing methods. We further evaluate common pitfalls in k-mer processing, which can cause major inefficiencies. Combined, our approaches allow the utilization of spaced k-mers in high-performance bioinformatics applications without major performance degradation, offering a throughput of up to 750MB of sequence data per second per core. Availability: The implementation in C++20 is published under the MIT license, and freely available at https://github.com/lczech/fisk
Problem

Research questions and friction points this paper is trying to address.

spaced k-mers
nucleotide sequences
k-mer extraction
bioinformatics performance
sequence processing
Innovation

Methods, ideas, or system contributions that make the work stand out.

spaced k-mers
bit manipulation
high-performance bioinformatics
k-mer extraction
CPU optimization
🔎 Similar Papers
No similar papers found.