Figure 7.

Demonstration of the module order algorithm. (a) Example blocks which cannot be combined since they are on different strand sides or far apart in the cluster. (b) An all-vs.-all matrix which generates hypothetical combined block pairs. Each block can be either at the beginning or the end of the newly generated block. Unreasonable combinations are excluded, marked with a red line. (c) A hypothetical example of 2 alignments performed for the D-A block combination. Each combination is scored with 252 reference BGCs. (d) Based on the score assigned to each block pair, the best scoring pairs are extracted and combined to the final block.