摘要
序列比对是生物信息学中一种基本的信息处理方法,在序列比对所使用的算法中当前重点解决的问题是如何降低算法的时间和空间复杂度。在介绍基本动态规划原理的基础上,提出了一种基于动态规划思想的优化序列比对算法。对3种算法对比实验表明,该算法在保证其生物敏感性的基础上,有效地降低了时间和空间复杂度。
Sequence alignment is a basic information disposal method in bioinformatics. It is an important problem to reduce time and space complexity in sequence alignment algorithm currently. So a dynamic programming algorithm element and presented an optimized sequence alignment algorithm are presented based on dynamic programming. The experimental result shows that the algorithm can reduce time and space complexity effectively on the basis of ensuring the biology sensitivity.
出处
《计算机工程与设计》
CSCD
2004年第11期1936-1937,1945,共3页
Computer Engineering and Design
基金
北京市科技计划基金项目(H020720030530-1)。
