Skip to main content

Advertisement

Fig. 1 | Algorithms for Molecular Biology

Fig. 1

From: A safe and complete algorithm for metagenomic assembly

Fig. 1

Node-safe walks. In a, the walk (abcd) is node-safe, because every circular walk covering node e contains (abcd) as sub-walk (we draw one such circular walk in orange). In b, the walk (abcd) is not node-safe, because the graph admits two circular walks covering all nodes (in blue and red) that do not contain it as sub-walk; it does not satisfy condition (b) of Theorem 2. In c the walk (abcd) is not safe because there is a node-covering circular walk not containing it as sub-walk (in green); it does not satisfy condition (a) of Theorem 2

Back to article page