| Abstract: |  In this thesis the Iterative Prototype Optimization with Evolved Improvement Step algorithm is applied on problem from bioinformatic, which is called DNA Fragment Assembly. This problem is situated on final stage of DNA reading, especially long strands of DNA. Long strands cut many times into large set of fragments. Fragments are than assembled by computer into string corresponding with source DNA. This process is very complicate because the order and direction of fragments is lost in early stage.
The algorithm was implemented and adjusted for needs of DNA Fragment Assembly Problem. Its performance were tested on standard benchmarks and compared to other assembly projects. The result are promising, but efficiency must be improved.
|
|---|