Figure 5.

Correction search algorithm. Pseudocode for the algorithm to search for the most likely set of corrections that makes all k-mers in the read trusted. P is a heap-based priority queue that sorts sets of corrections C by their likelihood ratio L. The algorithm examines sets of corrections in decreasing order of their likelihood until a set is found that converts all k-mers in the read to trusted k-mers.

Kelley et al. Genome Biology 2010 11:R116   doi:10.1186/gb-2010-11-11-r116
Download authors' original image