Fig. 2From: Using the longest run subsequence problem within homology-based scaffoldingProcessing of a single contig \(A_1\). The bins are matched against all contigs of another sample B. Solving Longest Run Subsequence (LRS) on the corresponding string S, yields a maximal subsequence with at most one run for every contig. This induces an optimal order for a subset of B-contigsBack to article page