| 基于高分片段对的双序列比对分治算法SPDCA |
| |
| 引用本文： | 吕艳萍,陈水利,陈国龙. 基于高分片段对的双序列比对分治算法SPDCA[J]. 集美大学学报(自然科学版), 2007, 12(1): 68-72 |
| |
| 作者姓名： | 吕艳萍 陈水利 陈国龙 |
| |
| 作者单位： | 福州大学数学与计算机科学学院,福建,福州,350002;集美大学理学院,福建,厦门,361021 |
| |
| 摘 要： | 针对传统双序列比对算法的高时空复杂性,在动态规划比对算法的基础上,引入了片段对和分治思想,提出了一个新型的基于高分片段对的分治算法.模拟结果表明:该算法在降低了双序列比对算法的时空需求的同时,还能发现双序列之间微弱的相似关系,可适用于序列数据库相似性的搜索.
|
| 关 键 词： | 生物信息学 双序列比对 动态规划 高分片段对 分治 |
| 文章编号： | 1007-7405（2007）01-0068-05 |
| 收稿时间： | 2004-11-30 |
| 修稿时间： | 2004-11-30 |
Pairwise Sequence Alignment Based on High-segment Pairs |
| |
| LU Yan-ping,CHEN Shui-li,CHEN Guo-long. Pairwise Sequence Alignment Based on High-segment Pairs[J]. the Editorial Board of Jimei University(Natural Science), 2007, 12(1): 68-72 |
| |
| Authors: | LU Yan-ping CHEN Shui-li CHEN Guo-long |
| |
| Abstract: | The traditional algorithm for pairwise sequence alignment has the high complexity of time and space.Based on the dynamic programming alignment algorithm,high-segment pairs,divide and conquer are introduced.Furthermore,a new alignment algorithm called SPDCA is deduced.Simulation results show that the algorithm lower pairwise sequence alignment algorithm's requirement of time and space,that it can help find the subtle similarity between pairwise sequences,and thus that it is applicable to the search of sequence database similarity. |
| |
| Keywords: | bioinformatics pairwise sequence alignment dynamic programming high-segment pairs divide and conquer |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
