Charging Station: Reconstructing String in Paired De Bruijn Graph
Reconstruct strings using paired de Bruijn graphs.
We'll cover the following
Consider the following Eulerian path formed by nine edges in the paired de Bruijn graph from the figure below.
AG-AG → GC-GC → CA-CT → AG-TG →GC-GC → CT-CT → TG-TG → GC-GC → CT-CA
Get hands-on with 1200+ tech skills courses.