There were ties along the way.

There were cases where we had a tie in terms of which

nodes we could glue together, in terms of which overlaps had the greatest weight.

And we broke them in a certain way, and

it's a little bit different from the way we broke the ties before.

And as a result, we actually ended up with a different superstring.

And in fact, in this case, if you look at this line here,

here are two strings that have no overlap with each other.

There's no suffix, prefix match between these two strings.

So, this was a case where if we'd drawn out the graph,

we would have seen that the graph had two nodes left and

zero edges left at the end of the repeated merging of nodes.

So we concatenated them together to get the final superstring.