A hybrid PSO-based algorithm for solving DNA fragment assembly problem

Ko Wei Huang, Jui Le Chen, Chu Sing Yang

研究成果: Paper同行評審

5 引文 斯高帕斯(Scopus)

摘要

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.

原文English
頁面223-228
頁數6
DOIs
出版狀態Published - 2012 十二月 12
事件3rd International Conference on Innovations in Bio-Inspired Computing and Applications, IBICA 2012 - Kaohsiung City, Taiwan
持續時間: 2012 九月 262012 九月 28

Other

Other3rd International Conference on Innovations in Bio-Inspired Computing and Applications, IBICA 2012
國家Taiwan
城市Kaohsiung City
期間12-09-2612-09-28

All Science Journal Classification (ASJC) codes

  • Bioengineering
  • Software

指紋 深入研究「A hybrid PSO-based algorithm for solving DNA fragment assembly problem」主題。共同形成了獨特的指紋。

引用此