Determining the sequence of a long DNA chain first requires dividing it into subset fragments. The DNA fragment assembly (DFA) approach is then used for reassembling the fragments as an NP-hard problem that is the focus of increasing attention from combinatorial optimization researchers within the computational biology community. Particle swarm optimization (PSO) is one of the most important swarm intelligence meta-heuristic optimization techniques to solve NP-hard combinatorial optimization problems. This paper proposes a memetic PSO algorithm based on two initialization operators and the local search operator for solving the DFA problem by following the overlap–layout–consensus model to maximize the overlapping score measurement. The results, based on 19 coverage DNA fragment datasets, indicate that the PSO algorithm combining tabu search and simulated annealing-based variable neighborhood search local search can achieve the best overlap scores.
All Science Journal Classification (ASJC) codes
- Artificial Intelligence