bioRxivBioinformaticsPreprint
A fast and simple approach to k-mer decomposition
Abstract
Alignment searches are fast heuristic methods to identify similar regions between two sequences. This group of algorithms is ubiquitously used in a myriad of software to find homologous sequences or to map sequence reads to genomes. Often the first step in alignment searches is k-mer decomposition: listing all overlapping subsequences of length k. This article presents a simple integer representation of k-mers and shows how a sequence can be quickly decomposed into k-mers in constant time with respect to k.
- Citations
- 0
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.
Related papers
- Back to sequences: find the origin of kmers
Anthony Baire, Pierre Marijon, … Pierre Peterlongo·The Journal of Open Source SoftwarePeer-reviewed·Sep 23, 2024
- Accelerating k-mer-based sequence filtering
Igor Martayan, Léa Vandamme, … Antoine Limasset·Peer Community JournalPeer-reviewed·Jun 17, 2026
- Theory of local k-mer selection with applications to long-read alignment
Jim Shaw, Yun William Yu·BioinformaticsPeer-reviewed·Nov 16, 2021
- Sequence alignment with k-bounded matching statistics
Tommi Mäklin, Jarno Alanko, … Simon J. Puglisi·bioRxiv·May 19, 2025
- Sequence aligners can guarantee accuracy in almost O(m log n) time: a rigorous average-case analysis of the seed-chain-extend heuristic
Jim Shaw, Yun William Yu·Genome ResearchPeer-reviewed·Jul 1, 2023
- Efficient minimizer orders for large values of k using minimum decycling sets
David Pellow, Lianrong Pu, … Yaron Orenstein·Genome ResearchPeer-reviewed·Aug 9, 2023