Identifying all snarls and superbubbles in linear-time, via a unified SPQR-tree framework

2025-11-26

AI Summary

This work addresses the efficient identification of two fundamental bubble-like structures—snarls and superbubbles—in pangenome graphs. We propose the first unified linear-time algorithmic framework based on SPQR-tree decomposition. Our method leverages the SPQR tree to precisely encode all 2-separators of the graph and integrates linear-time graph traversal, enabling, for the first time theoretically, the complete enumeration of snarls in linear time while uniformly handling superbubbles. The core contribution lies in revealing the essential role of 2-separators in characterizing bubble-like structures and establishing a general, extensible decomposition paradigm. An optimized C++ implementation demonstrates significant speedups: snarl detection is twice as fast as vg, and superbubble detection is 50× faster than BubbleGun—while ensuring full correctness and completeness. The method consistently outperforms existing tools in accuracy, efficiency, and scalability, providing a robust computational foundation for structural variant genotyping, haplotype sampling, and pangenome indexing.

Technology Category

• Search and Optimization: Combinatorial Optimization
• Machine Learning: Graph-based Machine Learning
• Computer Vision: Segmentation

Application Category

• Graph Algorithms and Modeling for the Web: Representation, reconstruction, and subgraph or motif discovery in Web-related graphs
• Search and Retrieval-Augmented AI: Web query analysis, representation and understanding
• Semantics and Knowledge: Methods, algorithms and applications for the development of semantic models, knowledge graphs and other forms of structured data models with machine-interpretable semantics

Abstract

Snarls and superbubbles are fundamental pangenome decompositions capturing variant sites. These bubble-like structures underpin key tasks in computational pangenomics, including structural-variant genotyping, distance indexing, haplotype sampling, and variant annotation. Snarls can be quadratically-many in the size of the graph, and since their introduction in 2018 with the vg toolkit, there has been no work on identifying all snarls in linear time. Moreover, while it is known how to find superbubbles in linear time, this result is a highly specialized solution only achieved after a long series of papers. We present the first algorithm identifying all snarls in linear time. This is based on a new representation of all snarls, of size linear in the input graph size, and which can be computed in linear time. Our algorithm is based on a unified framework that also provides a new linear-time algorithm for finding superbubbles. An observation behind our results is that all such structures are separated from the rest of the graph by two vertices (except for cases which are trivially computable), i.e. their endpoints are a 2-separator of the underlying undirected graph. Based on this, we employ the well-known SPQR tree decomposition, which encodes all 2-separators, to guide a traversal that finds the bubble-like structures efficiently. We implemented our algorithms in C++ (available at https://github.com/algbio/BubbleFinder) and evaluated them on various pangenomic datasets. Our algorithms outcompete or they are on the same level of existing methods. For snarls, we are up to two times faster than vg, while identifying all snarls. When computing superbubbles, we are up to 50 times faster than BubbleGun. Our SPQR tree framework provides a unifying perspective on bubble-like structures in pangenomics, together with a template for finding other bubble-like structures efficiently.

Problem

• Develops a linear-time algorithm to identify all snarls in pangenome graphs
• Provides a unified SPQR-tree framework for finding bubble-like structures efficiently
• Enables faster computation of snarls and superbubbles for pangenomic analysis tasks

Innovation

• Linear-time snarl identification via SPQR-tree framework
• Unified SPQR-tree approach for both snarls and superbubbles
• Efficient bubble-like structure detection using 2-separator encoding