This project deals with “fragment assembly” algorithms for a common task in bioinformatics: DNA sequencing. It can be modeled as combinatorial problems involving graph theoretical results and Multiple Sequence Alignment. The goal is to improve one particular method called “Eulerian Superpath”, by refining the error correction procedure which proved to be central to performance of Eulerian Superpath.