基于动态规划的基因双序列比对研究  

Dynamic Programming in Pair Sequences Alignment

作　　者：罗志兵 LUO Zhi-bing(College of Big Data and Intelligence Engineering, Southwest Forestry University, Kunming 65022)

机构地区：[1]西南林业大学大数据与智能工程学院,昆明650224

出　　处：《现代计算机（中旬刊）》2017年第11期28-33,37,共7页Modern Computer

摘　　要：在生物信息学的研究中,最基础的问题是对生物序列进行分析,序列比对是最基本的操作。通过比对找出序列间的相似性,根据相似性进行同源性分析,推导出演化过程。因此,序列比对常用于研究由共同祖先进化而来的序列,特别是如蛋白质序列或DNA序列等生物序列。它对于发现生物序列中的功能、结构和进化信息具有非常重要的意义。如何开发出高效、准确的序列比对算法是目前序列比对的一个重点。经过对双序列比对算法的研究,探索动态规划算法在全局比对和局部比对中的应用以及算法的实现过程。DNA or Protein sequences analysis is the most important job in bioinformaties and sequences alignment is the most fundamental operation. Similarities between the sequenees are found by sequences alignment. Those similarities can he used to analyze homology in DNA or pro- tein sequences ancl derivate evolution information. Therefore, sequences alignment is really important in derivation of infomation about pro- tein function and structures. Nowadays, improving correction and redueiug time consumption in searching algorithms has beeome the main problem in this field. By doing research in algorithms about solving pair sequences alignment, puts forward dynamic programming algo- rithm in solving both global alignment and local alignment, and also gives an implementation of dynamie programming.

关 键 词：生物信息学 序列比对 动态规划 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]