De Bruijn graphs: Comparison with Overlap Graphs
Let’s look into the possible conditions for choosing a specific graph.
We'll cover the following...
De Bruijn vs. overlap graphs
We now have two ways of solving the String Reconstruction Problem. We can either find a Hamiltonian path in the overlap graph or find an Eulerian path in the de Bruijn graph (figure below). Your inner voice may have already started complaining: was it really worth my time ...