Repository navigation
Add d-bubbles - #8
Merged
Merged
Conversation
CMoumard
force-pushed
the
add-d-bubbles
branch
2 times, most recently
from
November 8, 2026 23:09
aca1964 to
06cd7f0
Compare
Find d-bubbles with dominator trees and allow ultrabubble filtering through ultrabubbles --d-bubbles. Include the bubble hierarchy for graph analyses. Reduce GFA parser memory use and limit the GBZ cache. LLMs were used in some parts of this code.
CMoumard
force-pushed
the
add-d-bubbles
branch
from
November 8, 2026 23:14
06cd7f0 to
2b2d1ce
Compare
CMoumard
added a commit
that referenced
this pull request
Nov 9, 2026
Find d-bubbles with dominator trees and allow ultrabubble filtering through ultrabubbles --d-bubbles. Include the bubble hierarchy for graph analyses. Reduce GFA parser memory use and limit the GBZ cache. LLMs were used in some parts of this code.
CMoumard
added a commit
that referenced
this pull request
Nov 9, 2026
Find d-bubbles with dominator trees and allow ultrabubble filtering through ultrabubbles --d-bubbles. Include the bubble hierarchy for graph analyses. Reduce GFA parser memory use and limit the GBZ cache. LLMs were used in some parts of this code.
CMoumard
added a commit
that referenced
this pull request
Nov 9, 2026
Find d-bubbles with dominator trees and allow ultrabubble filtering through ultrabubbles --d-bubbles. Include the bubble hierarchy for graph analyses. Reduce GFA parser memory use and limit the GBZ cache. LLMs were used in some parts of this code.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
We first turn the bidirected graph into a directed doubled graph. Each node has two copies,
v+andv-. Each bidirected edge gives two directed edges, one for each direction.We add two artificial nodes: a source
Sand a sinkT.Sconnects to the starting copy of each graph tip. The ending copy of each tip connects toT.A d-bubble is then a dominator pair:
u+immediately dominatesv+fromS, andv+immediately postdominatesu+towardT. The corresponding endpoints areu+andv-in the bidirected graph: the walk entersvthrough-, which corresponds to thev+copy.Every walk between graph tips that visits the interior must pass through both endpoints. D-bubbles can contain cycles, need not be separable, and form a nested hierarchy.
A preprint presenting the theoretical framework and proofs, Dominator-bubbles: variation structures beyond separability in pangenome graphs, is expected soon.
The red edge makes the example nonseparable. The highlighted tree edges still identify the d-bubble with endpoints
u+andv-.The new commands are:
The second command keeps only ultrabubbles among the d-bubble candidates. Use
-Tto include trivial bubbles. This PR also reduces memory use in the GFA and GBZ parsers.