bioRxivBioinformaticsPreprint
TahcoRoll: An Efficient Approach for Signature Profiling in Genomic Data through Variable-Length k-mers
Chelsea J.‐T. JuiD, Jyun‐Yu JiangiD, Ruirui LiiD, Zeyu LiiD, Wei WangiD
Abstract
k-mer profiling has been one of the trending approaches to analyze read data generated by high-throughput sequencing technologies. The tasks of k-mer profiling include, but are not limited to, counting the frequencies and determining the occurrences of short sequences in a dataset. The notion of k-mer has been extensively used to build de Bruijn graphs in genome or transcriptome assembly, which requires examining all possible k-mers presented in the dataset. Recently, an alternative way of profiling has been proposed, which constructs a set of representative k-mers as genomic markers and profiles their occurrences in the sequencing data. This technique has been applied in both transcript quantification through RNA-Seq and taxonomic classification of metagenomic reads. Most of these applications use a set of fixed-size k-mers since the majority of existing k-mer counters are inadequate to process genomic sequences with variable-length k-mers. However, choosing the appropriate k is challenging, as it varies for different applications. As a pioneer work to profile a set of variable-length k-mers, we propose TahcoRoll in order to enhance the Aho-Corasick algorithm. More specifically, we use one bit to represent each nucleotide, and integrate the rolling hash technique to construct an efficient in-memory data structure for this task. Using both synthetic and real datasets, results show that TahcoRoll outperforms existing approaches in either or both time and memory efficiency without using any disk space. In addition, compared to the most efficient state-of-the-art k-mer counters, such as KMC and MSBWT, TahcoRoll is the only approach that can process long read data from both PacBio and Oxford Nanopore on a commodity desktop computer. The source code of TahcoRoll is implemented in C++14, and available at https://github.com/chelseaju/TahcoRoll.git.
- assay: long-read sequencing
- research focus: benchmarking
- research focus: variant calling
- approach: statistical model
- approach: experimental assay
- Citations
- 2
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
- Accelerating k-mer-based sequence filtering
Igor Martayan, Léa Vandamme, … Antoine Limasset·Peer Community JournalPeer-reviewed·Jun 17, 2026
- KmerStream: Streaming algorithms for k-mer abundance estimation
Páll Melsted, Bjarni V. Halldórsson·bioRxiv·Apr 7, 2014
- Squeakr: An Exact and Approximate k-mer Counting System
Prashant Pandey, Michael A. Bender, … Rob Patro·BioinformaticsPeer-reviewed·Oct 6, 2017
- kache-hash: A dynamic, concurrent, and cache-efficient hash table for streaming k-mer operations
Jamshed Khan, Rob Patro, Prashant Pandey·bioRxiv·Feb 16, 2026
- Back to sequences: find the origin of kmers
Anthony Baire, Pierre Marijon, … Pierre Peterlongo·The Journal of Open Source SoftwarePeer-reviewed·Sep 23, 2024
- BLight: Efficient exact associative structure for k-mers
Camille Marchet, Maël Kerbiriou, Antoine Limasset·bioRxiv·Mar 29, 2021