Table 1 Comparison of runtime (in seconds) between DP and ILP on instances from real data. The times are for all 16 instances that proved difficult for the previous brute-force method. The columns correspond to different reduction rules used

From: Using the longest run subsequence problem within homology-based scaffolding