Abstract：
Ant-colony algorithm, MMAS(Max-Min Ant-colony Algorithm) and adaptive ant-colony algorithm are discussed in this paper. DNA sequence alignment is one of important tools in bioinformatics research. We discuss the process that adaptive ant-colony algorithm is applied in sequence alignment mainly. First, we give a scoring function and score points the strategy, a pair of DNA sequence is generated randomly and create sequence alignment matrix. 4 ants move from on left angular orientation to right under angle and finally arrives the right under angle, Hence 4-ways are obtained and 4 sequence alignment of same length is obtained too. According to scoring function, we calculate these scoring and max-value of these sequence alignment is the best route.; Second, information element are adjusted by its increase and are stored in information element matrix. Finally, The route that ant select is according with information adjustment. Through limiting iterative times, A best route is selected and get the result that these two DNA chains are same.
Keywords：Standard Ant-colony algorithm, (MMAS) Max-Min Ant-colony Algorithm, adaptive ant-colony algorithm, DNA sequence alignment
