动态规划法进行基因双序列比对的探索和实现

Exploration and Realization of Gene Double Sequence Alignment by Dynamic Programming

动态规划法是生物信息学中一个最流行的解决方法,序列的比较、基因的识别、蛋白质序列的重排以及蛋白质结构和功能的分析等很多生物信息学中的问题都可以通过动态规划法解决,但是动态规划法消耗的时间太长,因此一般用于双序列比对问题的求解中。通过分析序列比对的特征,结合动态规划法的思想,实现了用动态规划法进行同源DNA双序列比对。给出了具体比对的过程,并列出了算法的实现步骤。

Dynamic programming is one of the most popular methods in bioinformatics. Many bioinformatics problems, such as sequence comparison, gene recognition, protein sequence rearrangement, and protein structure and function analysis, can be solved by dynamic programming, but dynamic programming consumes too much time, so it is generally used to solve double sequence alignment problems. In this paper, by analyzing the characteristics of sequence alignment and combining with the idea of dynamic programming method, the homologous DNA double sequence alignment using dynamic programming method is realized. The specific process of comparison is given, and the implementation steps of the algorithm are listed.