String Reconstruction with Overlap Graph: Hamiltonian Paths

Understand how to reconstruct DNA strings by finding Hamiltonian paths in overlap graphs. Learn about k-universal strings, de Bruijn graphs, and their role in genome assembly to grasp fundamental bioinformatics algorithms.