A Graph Theoretical Algorithmic Approach for DNA Sequencing

In this paper, an algorithmic approach is developed to solve the combinatorial part of DNA sequencing by hybridization using graph theoretical concepts. It is assumed here, that the spectrum is ideal one and fragments are of equal length. The goal is to reconstruct the DNA molecule based on the fragments overlap. Suitable examples are also provided to justify the algorithm.