In this paper, a hybrid particle swarm optimization algorithm (HPSO) is proposed for the DNA fragment assembly (DFA) problem by maximizing the overlapping-score measurement. The smallest position value (SPV) rule is used for encoding the particles to enable PSO to be suitable for DFA, and the Tabu search algorithms are used to initialize the particles. Additionally, a simulated annealing (SA) algorithm-based local search is utilized for local search to improve the best solution after the PSO search process. Finally, the results show that HPSO can significantly get better overlap score than other PSO-based algorithms with different-sized benchmarks.
|出版狀態||Published - 2012 12月 12|
|事件||3rd International Conference on Innovations in Bio-Inspired Computing and Applications, IBICA 2012 - Kaohsiung City, Taiwan|
持續時間: 2012 9月 26 → 2012 9月 28
|Other||3rd International Conference on Innovations in Bio-Inspired Computing and Applications, IBICA 2012|
|期間||12-09-26 → 12-09-28|
All Science Journal Classification (ASJC) codes