Figure 2

Two examples of choice as proposed by the program. (A) The best global solution appears as a concatenation of blue, red, and green fragments. Because the program works locally only on a pair of copies, the best choice to start with is 0, assembling blue and red; after this selection, the program will automatically detect that the assembled blue-red could be concatenated with the green fragment and either propose it to the user if there is ambiguity or assemble them together if the case is unambiguous. (B) The best global solution appears to be the concatenation of blue and green (solution 1) rather than blue and red (solution 0).