Fig. 4From: Single molecule sequencing-guided scaffolding and correction of draft assembliesAn example of the NP-completeness reduction. The reduction is from the Hamiltonian path problem to the decision version of the scaffolding problem. The instance of the Hamiltonian path problem is the 5-vertex graph on the left. The instance of the decision version of the scaffolding problem is the entire graph, including the dashed edgesBack to article page