Fig. 3From: Using the longest run subsequence problem within homology-based scaffoldingGraph visualizing the recursion for the running example. Arcs represent the possible predecessors for every run. Colors mark an optimal path and the DP entries taken by the recursionBack to article page