Skip to main content


Fig. 1 | Algorithms for Molecular Biology

Fig. 1

From: Kermit: linkage map guided long read assembly

Fig. 1

Overview of our method. First the reads are mapped to the draft assembly and assigned colours (top left). Each colour represents one bin in the linkage map. In this example we have three bins (brown, green and red) and the ordering of the bins is brown < green < red. All bins belong to the same chromosome. Miniasm is then used to construct the overlap graph which is augmented with the colours. Next vertex \(f\) is coloured through the colour propagation process. Finally we remove the edges \((a, i)\) and \((h, b)\) because they have inconsistent colourings

Back to article page