Scientists combine small gene fragments extracted from cells to form a long genomic sequence. To achieve this, each fragment can be considered as a node in a directed graph. An edge is added between fragment i and j if there is an overlap between the end of i and the start of j. Model this Hamiltonian path problem as a local search problem