Identifying bubble-like subgraphs in linear-time via a unified SPQR-tree framework

Francisco Sena, Aleksandr Politov, Corentin Moumard +6

A fundamental algorithmic problem in computational biology is to find all subgraphs of a given type (superbubbles, snarls, and ultrabubbles) in a directed or bidirected input graph…