DNA序列匹配算法研究与优化

Research and Optimization of DNA Sequence Matching Algorithm

DNA比对是生物信息学中最基本的问题,在生物信息学中发挥了至关重要的作用。利用计算机研究DNA比对是一个热点问题。笔者讨论的实现最佳DNA序列匹配的基本方法有两种,分别是利用分置算法和动态规划算法进行DNA序列对齐匹配。利用这两种算法,可以得到最优匹配代价。改进后的动态规划算法具有更好的性能,可以得到最优的DNA匹配序列。

DNA alignment is the most basic problem in bioinformatics and plays a vital role in bioinformatics.Using computer to study DNA comparison is a hot topic.There are two basic methods to achieve the best DNA sequence matching discussed in this paper.They are DNA sequence alignment matching using splitting algorithm and dynamic programming algorithm.Using these two algorithms,the optimal matching cost can be obtained.The improved dynamic programming algorithm has better performance and can obtain the optimal DNA matching sequence.