I have a question about exactly how the multiplicity of an edge in the de Bruijn graph is determined. It seems that the multiplicity is simply the number of reads which covers an edge.

However, this seems to not be the complete story. Later, the paper goes on to discuss x,y-detachment. At the bottom of page 9752, left column, they state:

The second condition implies that the Eulerian Superpath
Problem has no solution, because P, Px,y1, and Px,y2 impose
three different scenarios for just two visits of the edge x.

My assumption here is that each of these paths is a read. Thus, there are three reads. Thus, the multiplicity of x would always be three. In other words, this second condition can never occur in a graph that was created from a set of reads, because there would be three visits (multiplicity three), rather than two visits.

In actual practice, this gets more complicated by including reverse compliments and self loops (i.e. AA -> AA (by AAA)).

What Pezner is referring to here is if you have one entrance and two exits from a node. You know that there is only one way to visit the node x, but observe two exits. This can't happen if you only visit the node once.

What Pezner is referring to here is if you have one entrance and two exits from a node. You know that there is only one way to visit the node x, but observe two exits. This can't happen if you only visit the node once.

Hm...that would be if a node had in-total-multiplicity of 1, and and out-total-multiplicity of 2, correct? That's not the case in Fig. 5b, though. In fact, in Fig. 5b, the multiplicities don't seem to match the paths. My understanding is that in that figure, there are three paths corresponding to three reads. In that case, the multiplicity of edge x should be 3, not 2, correct?