Parallel ACO for DNA Sequencing by Hybridization

Authors:
Xie Hongwei;Luo Yanhua
Affiliations:
-;-
Venue:
CSIE '09 Proceedings of the 2009 WRI World Congress on Computer Science and Information Engineering - Volume 04
Year:
2009

Citing 0
Cited 2

Comparison of different topologies for island-based multi-colony ant algorithms for the minimum weight vertex cover problem

WSEAS Transactions on Computers
A survey on parallel ant colony optimization

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

DNA sequencing by hybridization (SBH) is an important method in bioinformatics, and it has been proved to be a NP-hard problem in combinatorial optimization. It has two demerits which are the lower precision of solution and the lower speed of convergence in serial ACO，tabu search and evolutionary algorithm for DNA sequencing by hybridization. In this paper an improved parallel ACO algorithm (IPACO) was proposed for DNA sequencing by hybridization in this paper. It shows a better performance compared with serial ACO，tabu search and evolutionary algorithm in precision and convergence based on the experiments.