Walking in the de Bruijn Graph
Explore the concept of Eulerian paths within de Bruijn graphs to understand how genome assembly is achieved. This lesson explains how finding a path that visits every edge exactly once in the graph corresponds to reconstructing the original DNA sequence from short reads. You will gain insights into solving the String Reconstruction Problem by applying graph theory concepts to biological data.
We'll cover the following...
We'll cover the following...
Eulerian paths
Even though we’ve glued together nodes to form the de Bruijn graph, we haven’t changed its edges, and so the path from TA to TT reconstructing the genome is still hiding in DeBruijn ...