Restarting and recentering genetic algorithm variations for DNA fragment assembly: The necessity of a multi-strategy approach

DNA Fragment assembly – an NP-Hard problem – is one of the major steps in of DNA sequencing. Multiple strategies have been used for this problem, including greedy graph-based algorithms, deBruijn graphs, and the overlap-layout-consensus approach. This study focuses on the overlap-layout-consensus ap...

Celý popis