Start with superbubble detection implementation
Start with superbubble detection implementation

Currently possible to partition a directed graph and convert a
graph to a DAG by duplicating some nodes, all following the
algorithm described by Sung et al.

Wing-Kin Sung, Sadakane, K., Shibuya, T., Belorkar, A., & Pyrogova,
I. (2015). An O(m log m)-Time Algorithm for Detecting Superbubbles.
IEEE/ACM Transactions on Computational Biology and Bioinformatics,
12(4), 770–777. http://doi.org/10.1109/TCBB.2014.2385696

AbeelLab/phasm,AbeelLab/phasm