Fig. 4From: Using the longest run subsequence problem within homology-based scaffoldingRunning time plotted against string length (top) and alphabet size (bottom). Each curve represents an algorithm and an additional parameter (number in parentheses), which is alphabet size in the top plot and the string length in the bottom plotBack to article page