| 基于智能蚁群算法的双序列比对方法 |
| |
| 引用本文： | 彭东海,骆嘉伟,陈斐.基于智能蚁群算法的双序列比对方法[J].科学技术与工程,2007,7(19):4909-4913. |
| |
| 作者姓名： | 彭东海 骆嘉伟 陈斐 |
| |
| 作者单位： | 1. 湖南大学计算机与通信学院,长沙,410082;湖南人文科技学院计算机系,娄底,417000
2. 湖南大学计算机与通信学院,长沙,410082 |
| |
| 基金项目： | 湖南省自然科学基金(06JJ4076)，湖南省财政厅项目[2005]90资助 |
| |
| 摘 要： | 序列比对是生物信息学中一项重要的基础性研究课题。提出了一种基于全新的信息素改变策略的智能蚁群算法,该算法利用历史最优信息来更新信息素,避免出现早熟现象,加速算法的后期收敛。实验表明该方法是有效的和可行的。
|
| 关 键 词： | 蚁群算法 序列比对信息素 |
| 文章编号： | 1671-1819(2007)19-4909-05 |
| 修稿时间： | 2007-05-21 |
Pair-wise Sequence Alignment Method Based on Intelligent Ant Colony Algorithm |
| |
| PENG Dong-hai,LUO Jla-wei,CHEN Fei.Pair-wise Sequence Alignment Method Based on Intelligent Ant Colony Algorithm[J].Science Technology and Engineering,2007,7(19):4909-4913. |
| |
| Authors: | PENG Dong-hai LUO Jla-wei CHEN Fei |
| |
| Institution: | College of Computer and Communication, Hunan University , Changsha 410082,P. R. China; 2.Department of Computer Science, Hunan Institute of Humanities and Science and Technology , Loudi 417000,P.R.China |
| |
| Abstract: | Sequence alignment is an important fundamental subject in bioinformatics. An Intelligent ant colony algorithm based on an new approach to alter pheromone is proposed. This new algorithm uses the history optimization information to update pheromone,avoids prematurity and accelerates the convergence of algorithm in later period. The results demonstrate that this new approach is reasonable and efficient. |
| |
| Keywords: | ant colony algorithm sequence alignment pheromone |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《科学技术与工程》浏览原始摘要信息 |
| 点击此处可从《科学技术与工程》下载免费的PDF全文 |
