Skip to main content
Fig. 4 | Algorithms for Molecular Biology

Fig. 4

From: Superbubbles revisited

Fig. 4

An example graph that is transformed in three DAGs after Algorithm 1. In every graph are the weak superbubbles (blue) and all superbubbles (green) marked. In a is the original graph shown. Here are the non singleton SCC are marked with a red square. In b, d are \({\tilde{G}}(C)\) for the SCC are shown and in c is \({\tilde{G}}({\hat{V}})\) shown. In e and g are \({\hat{G}}(C)\) are shown and in f again \({\tilde{G}}({\hat{V}})\) because no \({\hat{G}}({\hat{V}})\) is needed. In the three DAGs are no differentiation between superbubbles and weak superbubbles are possible because they are equivalent in DAGs. So here are only the weak superbubbles are marked. Note that in g the weak superbubble \(\langle 7,10\rangle\) of D is now also a superbubble. However, this can be simple detected later by checking if an edge (10, 7) exists

Back to article page