Skip to content

Add d-bubbles - #8

Merged
CMoumard merged 1 commit into
mainfrom
add-d-bubbles
Nov 9, 2026
Merged

CMoumard merged 1 commit into
mainfrom
add-d-bubbles

Conversation

@CMoumard

@CMoumard CMoumard commented Nov 8, 2026

Copy link
Copy Markdown
Collaborator

We first turn the bidirected graph into a directed doubled graph. Each node has two copies, v+ and v-. Each bidirected edge gives two directed edges, one for each direction.

We add two artificial nodes: a source S and a sink T. S connects to the starting copy of each graph tip. The ending copy of each tip connects to T.

A d-bubble is then a dominator pair: u+ immediately dominates v+ from S, and v+ immediately postdominates u+ toward T. The corresponding endpoints are u+ and v- in the bidirected graph: the walk enters v through -, which corresponds to the v+ 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+ and v-.

A bidirected d-bubble and its two dominator trees

The new commands are:

BubbleFinder d-bubbles -g GRAPH -o OUT
BubbleFinder ultrabubbles --d-bubbles -g GRAPH -o OUT

The second command keeps only ultrabubbles among the d-bubble candidates. Use -T to include trivial bubbles. This PR also reduces memory use in the GFA and GBZ parsers.

@CMoumard
CMoumard force-pushed the add-d-bubbles branch 2 times, most recently from aca1964 to 06cd7f0 Compare November 8, 2026 23:09
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
CMoumard merged commit 52ef871 into main Nov 9, 2026
1 check passed
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.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant