SCS and TSP in DNA sequencing

In this paper, we have taken the problem of DNA sequencing as an optimization problem and also proposed a combinatorial approach to get the original DNA sequence. For that, we consider the path in a weighted graph to maximize the travelling cost in solving the TSP having different intercity cost. This is a Hamiltonian path which gives the optimal solution to the DNA sequencing problem.