Abstract

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.