| 基于遗传算法的一种生物序列比对方法 |
| |
| 引用本文： | 敖友云,迟洪钦. 基于遗传算法的一种生物序列比对方法[J]. 计算机工程与设计, 2006, 27(19): 3647-3648,3651 |
| |
| 作者姓名： | 敖友云 迟洪钦 |
| |
| 作者单位： | 上海师范大学,数理信息学院,上海,200234;上海师范大学,数理信息学院,上海,200234 |
| |
| 摘 要： | 生物序列比对是对DNA（或RNA,蛋白质）序列,寻找和确定它们的相似部分或稳定区域.二重序列比对问题可采用动态规划方法求得其最优解;多重序列比对问题是一个NP完全的组合优化问题,有待进一步探索与研究.通过合理的编码表示,采用相应的遗传算子,设计了一种求生物序列比对的遗传算法.并对几组DNA序列进行了测试.
|
| 关 键 词： | 生物序列比对 多重序列比对 遗传算法 生物信息学 组合优化 |
| 文章编号： | 1000-7024（2006）19-3647-02 |
| 收稿时间： | 2005-08-08 |
| 修稿时间： | 2005-08-08 |
Approach to biological sequence alignment based on genetic algorithm |
| |
| AO You-yun,CHI Hong-qin. Approach to biological sequence alignment based on genetic algorithm[J]. Computer Engineering and Design, 2006, 27(19): 3647-3648,3651 |
| |
| Authors: | AO You-yun CHI Hong-qin |
| |
| Affiliation: | College of Mathematics and Science, Shanghai Normal University, Shanghai 200234, China |
| |
| Abstract: | The key of biological sequence(DNA,RNA,or Protein) alignment is to find their similar part or stable region.Pair-wise sequence alignment is solved by dynamic programming while multiple sequence alignment belongs to NP-complete combinatorial opti-mization problem and is still solved completely.An approach to biological sequence alignment based on genetic algorithm is presented by employing a suitable chromosome representation and its corresponding genetic operators.And several groups of sequences in the li-terature are tested. |
| |
| Keywords: | biological sequence alignment multiple sequence alignment genetic algorithm bioinformatics combinatorial optimization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
