Genome reconstruction using graph theory

With a given list of k-mers, we are attempting to reconstruct a genome whose k-mers are the same as the input list of k-mers. This will require the development of an algorithm. We will be exploring multiple methods, such as inspection, but we will ultimately be using graph theory. This will be used by, first, creating a graph of the given k-mers. We will then discuss the process of finding a Eulerian path from this constructed graph, leading to the final goal, a reconstructed genome.