Chaos-differential evolution for multiple sequence alignment

Authors:
Gui-wu Hu
Affiliations:
School of Mathematics & Computational Science, Guangdong University of Business Studies, Guangzhou, China
Venue:
IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application
Year:
2009

Citing 3
Cited 0

The multiple sequence alignment problem in biology

SIAM Journal on Applied Mathematics
Engineering Optimization Using a Simple Evolutionary Algorithm

ICTAI '03 Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence
An adaptive and iterative algorithm for refining multiple sequence alignment

Computational Biology and Chemistry

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multiple Sequence Alignment is one of the most important and challenging problem in bioinformatics, which is known as NP-hard problem. In this paper, a Chaos-differential evolution (CDE) is proposed to solve MSA. In the proposed CDE algorithm, DE and chaos are hybridized to combine the evolutionary searching ability of DE and overcoming local optima of chaotic local search. Simulation shows that novel algorithm has superior performance compared to other existing algorithms.