BioinformaticsBioinformaticsPeer-reviewed journal article
BubbleGun: Enumerating Bubbles and Superbubbles in Genome Graphs
Abstract
MotivationWith the fast development of third generation sequencing machines, de novo genome assembly is becoming a routine even for larger genomes. Graph-based representations of genomes arise both as part of the assembly process, but also in the context of pangenomes representing a population. In both cases, polymorphic loci lead to bubble structures in such graphs. Detecting bubbles is hence an important task when working with genomic variants in the context of genome graphs. ResultsHere, we present a fast general-purpose tool, called BubbleGun, for detecting bubbles and superbubbles in genome graphs. Furthermore, BubbleGun detects and outputs runs of linearly connected bubbles and superbubbles, which we call bubble chains. We showcase its utility on de Bruijn graphs and compare our results to vgs snarl detection. We show that BubbleGun is considerably faster than vg especially in bigger graphs, where it reports all bubbles in less than 30 minutes on a human sample de Bruijn graph of around 2 million nodes. AvailabilityBubbleGun is available and documented at https://github.com/fawaz-dabbaghieh/bubble_gun under MIT license. Contactfawaz@hhu.de or tobias.marschall@hhu.de Supplementary informationSupplementary data are available at Bioinformatics online.
- organism: human
- assay: whole-genome sequencing
- research focus: genome assembly
- approach: experimental assay
- Citations
- 19
- FWCI
- 0.82
- Field percentile
- top 33%
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
- Billi: Accurate and Scalable Bubble Detection in Pangenome Graphs
Shreeharsha G Bhat, Daanish Mahajan, Chirag Jain·bioRxiv·Nov 21, 2025
- Superbubbles, Ultrabubbles and Cacti
Benedict Paten, Jordan M. Eizenga, … Glenn Hickey·Journal of Computational BiologyPeer-reviewed·Feb 20, 2018
- Scalable computation of ultrabubbles in pangenomes by orienting bidirected graphs
Juha Harviainen, Francisco Sena, … Alexandru Ioan Tomescu·BioinformaticsPeer-reviewed·Jul 1, 2026
- Using 2k + 2 bubble searches to find SNPs in k-mer graphs
Reda Younsi, Dan MacLean·bioRxiv·Oct 27, 2014
- Integrating long-range connectivity information into de Bruijn graphs
Isaac Turner, Kiran V. Garimella, … Gil McVean·BioinformaticsPeer-reviewed·Mar 15, 2018
- deGSM: memory scalable construction of large scale de Bruijn Graph
Hongzhe Guo, Yilei Fu, … Bo Liu·IEEE Transactions on Computational Biology and BioinformaticsPeer-reviewed·Apr 30, 2019