Graph doubling reduces ultrabubble computation in bidirected graphs to weak superbubble detection, giving the first linear-time algorithm for the former.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
SMC forgets its initial condition geometrically in the jump chain and as 1/ℓ in continuous genetic distance, justifying independent-locus approximations.
citing papers explorer
-
The Power of Graph Doubling: Computing Ultrabubbles in a Bidirected Graph by Reducing to Weak Superbubbles
Graph doubling reduces ultrabubble computation in bidirected graphs to weak superbubble detection, giving the first linear-time algorithm for the former.
-
Rates of forgetting for the sequentially Markov coalescent
SMC forgets its initial condition geometrically in the jump chain and as 1/ℓ in continuous genetic distance, justifying independent-locus approximations.