By Topic

An Efficient Ant Colony Algorithm for Multiple Sequences Alignment

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ling Chen ; Yangzhou Univ., Yangzhou ; Lingjun Zou ; Chen, Y.

A multiple sequence alignment algorithm based on divide-and-conquer method and ant colony algorithms is proposed. In the algorithm, ant colony optimization method is used to partition the set of sequences into several subsections vertically. Then the procedure of partitioning is applied to the prefix family and the suffix family in a recursive manner until the lengths of the subsequences are all equal to 1. Experimental results show that the algorithm can get high quality solution and reduce the running time.

Published in:

Natural Computation, 2007. ICNC 2007. Third International Conference on  (Volume:4 )

Date of Conference:

24-27 Aug. 2007