Genome Reconstruction problem : By using De Bruijn graph

Since its early formulations, the genome assembly problem has attracted lots of interest from algorithm theoretic as well as from algorithm engineering point of view. In this problem, which is an inversion problem by nature, one is asked to reconstruct the entire DNA sequence from the short, randomly picked sequence fragments that a DNA sequencing instrument is able to read. In this study, the De Bruijn graph method will be examined to reconstruct the Genome. And discussed preferred k-mer length for this algorithm in ideal conditions.