engleski

Simplification of the Overlap Graph

Today, a lot of different DNA assembly methods exist and are being actively developed. In this thesis, we show how to efficiently prune unnecessary reads and overlaps from those supplied to us in the process of DNA assembly. We show algorithms for removing contained reads, transitive edges, collapsing unique joins and creating a string graph. A C++ implementation has also been provided and tested, with results presented in this work.

Layout; DNA assembly; String graph; C++

nije evidentirano