bioRxivBioinformaticsPreprint
aaKomp: Alignment-free amino acid k-mer matching for genome completeness assessment at scale
Johnathan WongiD, Lauren CoombeiD, René L. WarreniD, İnanç BiroliD
Abstract
In de novo sequencing projects, genome assembly optimization requires evaluating a number of candidate assemblies to identify optimal tool parameters. Yet, current completeness assessment tools like BUSCO and compleasm require 10-80 minutes per evaluation for gigabase-scale genomes, transforming what should be rapid iteration into time-intensive processes. These tools rely on alignment-based approaches and fixed ortholog databases, limiting their scalability across the tree of life. We present aaKomp, a scalable alignment-free tool that leverages amino acid k-mer matching and multi-index Bloom filters for rapid genome completeness assessment. Unlike current utilities, aaKomp supports user-defined reference databases, enabling customized assessments for any organism. In benchmarking against state-of-the-art tools using simulated T2T-CHM13 datasets, aaKomp achieved 68-fold faster execution and 15-fold lower memory consumption while maintaining accuracy. Testing on 94 Human Pangenome Reference Consortium assemblies and a European Eel assembly, aaKomp maintained one-minute runtimes (1.2 {+/-} 0.35 min) and low memory usage (<13.64 GB). aaKomps scoring system provides nuanced estimates rather than threshold-based classifications, offering increased resolution for tracking incremental improvements during iterative workflows. aaKomps speed, memory efficiency, and flexible database generation makes it well-suited for modern and biodiverse projects requiring the evaluation of hundreds of assemblies.
- organism: human
- organism: multiple species
- assay: whole-genome sequencing
- research focus: variant calling
- approach: statistical model
- 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
- miniBUSCO: a faster and more accurate reimplementation of BUSCO
Neng Huang, Heng Li·bioRxiv·Jun 3, 2023
- PaKman: Scalable Assembly of Large Genomes on Distributed Memory Machines
Priyanka Ghosh, Sriram Krishnamoorthy, Ananth Kalyanaraman·bioRxiv·Jan 17, 2019
- Merqury: reference-free quality, completeness, and phasing assessment for genome assemblies
Arang Rhie, Brian P. Walenz, … Adam M. Phillippy·Genome biologyPeer-reviewed·Sep 14, 2020
- RefKA: A fast and efficient long-read genome assembly approach for large and complex genomes
Yuxuan Yuan, Philipp E. Bayer, … David Edwards·bioRxiv·Apr 17, 2020
- Efficient De Novo Assembly and Recovery of Microbial Genomes from Complex Metagenomes Using a Reduced Set of k-mers
Hajra Qayyum, Amjad H. Ali, Masood Ur Rehman Kayani·bioRxiv·Jun 8, 2024
- ABySS 2.0: Resource-Efficient Assembly of Large Genomes using a Bloom Filter
Shaun D Jackman, Benjamin P Vandervalk, … Inanc Birol·bioRxiv·Aug 7, 2016