Prokrustean Graph: A substring index for rapid k-mer size analysis
Abstract
The widespread adoption of k-mers in bioinformatics has led to efficient methods utilizing genomic sequences in a variety of biological tasks. However, understanding the influence of k-mer sizes within these methods remains a persistent challenge, as the outputs of complex bioinformatics pipelines obscure this influence with various noisy factors. The choice of k-mer size is often arbitrary, with justification frequently omitted in the literature and method tutorials. Furthermore, recent methods employing multiple k-mer sizes encounter significant computational challenges. Nevertheless, most methods are built on well-defined objects related to k-mers, such as de Bruijn graphs, Jaccard similarity, Bray-Curtis dissimilarity, and k-mer spectra. The role of k-mer sizes within these objects is more intuitive and can be described by numerous quantities and metrics. Therefore, exploring these objects across k-mer sizes opens opportunities for robust analyses and new applications. However, the evolution of k-mer objects with respect to k-mer sizes is surprisingly elusive. We introduce a novel substring index, the Prokrustean graph, that elucidates the transformation of k-mer sets across k-mer sizes. Our framework built upon this index rapidly computes k-mer-based quantities for all k-mer sizes, with computational complexity independent of the size range and dependent only on maximal repeats. For example, counting maximal simple paths in de Bruijn graphs for k = 1, ..., 100 is achieved in seconds using our index on a gigabase-scale dataset. We present a variety of such experiments relevant to pangenomics and metagenomics. The Prokrustean graph is space-efficiently constructed from the Burrows-Wheeler Transform. Through this construction, it becomes evident that other modern substring indices inherently face difficulties in exploring k-mer objects across sizes, which motivated our data structure. Our implementation is available at: https://github.com/KoslickiLab/prokrustean.
02 /Specification & Classification
Click any tag to browse matching papers- Citations
- 0
- FWCI
- 0.00
- Field percentile
- 6th percentile
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
- Representation of k-mer sets using spectrum-preserving string sets
Amatur Rahman, Paul Medevedev·Journal of Computational BiologyPeer-reviewed·Dec 8, 2020
- CMash: fast, multi-resolution estimation of k-mer-based Jaccard and containment indices
Shaopeng Liu, David Koslicki·BioinformaticsPeer-reviewed·Apr 14, 2022
- FroM Superstring to Indexing: a space-efficient index for unconstrained k-mer sets using the Masked Burrows-Wheeler Transform (MBWT)
Ondřej Sladký, Pavel Veselý, Karel Břinda·Bioinformatics AdvancesPeer-reviewed·Nov 11, 2025
- A space and time-efficient index for the compacted colored de Bruijn graph
Fatemeh Almodaresi, Hirak Sarkar, … Rob Patro·BioinformaticsPeer-reviewed·Apr 16, 2018
- Fulgor: A fast and compact k-mer index for large-scale matching and color queries
Jason Fan, Noor Singh, … Rob Patro·Algorithms for Molecular BiologyPeer-reviewed·Jan 22, 2024
- Hyper-k-mers: efficient streaming k-mers representation
Igor Martayan, Lucas Robidou, … Antoine Limasset·bioRxiv·Nov 6, 2024