TY - JOUR

T1 - Efficient k -mer dataset compression using Eulerian covers of de Bruijn graphs and BWT

AU - Chen, Herman Z.Q.

AU - Kitaev, Sergey

AU - Lang, Xiaoyu

AU - Pyatkin, Artem

AU - Tang, Runbin

PY - 2025/12/5

Y1 - 2025/12/5

N2 - Transforming an input sequence into its constituent k-mers is a fundamental operation in computational genomics. To reduce storage costs associated with k-mer datasets, we introduce and formally analyze MCTR, a novel two-stage algorithm for lossless compression of the k-mer multiset. Our core method achieves a minimal text representation (W) by computing an optimal Eulerian cover (minimum string count) of the dataset's de Bruijn graph, enabled by an efficient local Eulerization technique. The resulting strings are then further compressed losslessly using the Burrows-Wheeler Transform (BWT). Leveraging de Bruijn graph properties, MCTR is proven to achieve linear time and space complexity and guarantees complete reconstruction of the original k-mer multiset, including frequencies. Using simulated and real genomic data, we evaluated MCTR's performance (list and frequency representations) against the state-of-the-art lossy unitigging tool greedytigs (from matchtigs). We measured core execution time and the raw compression ratio (cr = weight(M)/ weight(W), where M is the input sequence data). Benchmarks confirmed MCTR's data fidelity but revealed performance trade-offs inherent to lossless representation. GreedyTigs was significantly faster. Regarding raw compression, GreedyTigs achieved high ratios (cr ≈ 14) on noisy real data for its lossy sequence output. MCTR methods exhibited cr ≈ 1 (list) or even cr < 1 (frequency, due to count overhead) on clean simulated data, indicating minimal raw text reduction or even expansion. On real data, MCTR (frequency) showed moderate raw compression (cr ≈ 1.5-2.7), while MCTR (list) showed none (cr ≈ 1). Importantly, the full MCTR+BWT pipeline significantly outperforms BWT alone for enhanced lossless compression. Our results establish MCTR as a valuable, theoretically grounded tool for applications demanding efficient, lossless storage and analysis of k-mer multisets, complementing lossy methods optimized for sequence summarization.

AB - Transforming an input sequence into its constituent k-mers is a fundamental operation in computational genomics. To reduce storage costs associated with k-mer datasets, we introduce and formally analyze MCTR, a novel two-stage algorithm for lossless compression of the k-mer multiset. Our core method achieves a minimal text representation (W) by computing an optimal Eulerian cover (minimum string count) of the dataset's de Bruijn graph, enabled by an efficient local Eulerization technique. The resulting strings are then further compressed losslessly using the Burrows-Wheeler Transform (BWT). Leveraging de Bruijn graph properties, MCTR is proven to achieve linear time and space complexity and guarantees complete reconstruction of the original k-mer multiset, including frequencies. Using simulated and real genomic data, we evaluated MCTR's performance (list and frequency representations) against the state-of-the-art lossy unitigging tool greedytigs (from matchtigs). We measured core execution time and the raw compression ratio (cr = weight(M)/ weight(W), where M is the input sequence data). Benchmarks confirmed MCTR's data fidelity but revealed performance trade-offs inherent to lossless representation. GreedyTigs was significantly faster. Regarding raw compression, GreedyTigs achieved high ratios (cr ≈ 14) on noisy real data for its lossy sequence output. MCTR methods exhibited cr ≈ 1 (list) or even cr < 1 (frequency, due to count overhead) on clean simulated data, indicating minimal raw text reduction or even expansion. On real data, MCTR (frequency) showed moderate raw compression (cr ≈ 1.5-2.7), while MCTR (list) showed none (cr ≈ 1). Importantly, the full MCTR+BWT pipeline significantly outperforms BWT alone for enhanced lossless compression. Our results establish MCTR as a valuable, theoretically grounded tool for applications demanding efficient, lossless storage and analysis of k-mer multisets, complementing lossy methods optimized for sequence summarization.

KW - BWT

KW - Compression

KW - De Bruijn graph

UR - https://www.scopus.com/pages/publications/105024074068

UR - https://www.mendeley.com/catalogue/a18b1134-31ae-39a0-afe5-bbf2c61b140c/

U2 - 10.1051/ita/2025020

DO - 10.1051/ita/2025020

M3 - Article

VL - 59

JO - RAIRO - Theoretical Informatics and Applications

JF - RAIRO - Theoretical Informatics and Applications

SN - 0988-3754

ER -