序列比对算法简单研究  

Research of Sequence Alignment Algorithm

作　　者：魏大木[1] 陶宏才[2] 

机构地区：[1]西南交通大学生命科学与工程学院,四川成都610031 [2]西南交通大学信息工程学院,四川成都610031

出　　处：《微计算机信息》2011年第4期201-203,共3页Control & Automation

摘　　要：序列比对是设计具有针对性的有效算法对两个或多个DNA、RNA或蛋白质序列进行比较,找出它们之间最大相似性匹配进而判断其是否具有同源性。本论文探讨了全局序列比对算法——Smith Waterman算法,提出了一种用数组记录序列比对过程中遍历路径的方法并对比对过程进行递归调用,使之能找出全部具有最大相似性的比对结果,以获得最佳路径。并对多序列比对进行了简单的讨论。sequence alignment is to devise pertinent and efficient algorithms to discern the most similar matching between two sequences of DNA、RNA or many sequences of DNA 、RNA,or protein through some certain algorithms,and then to establish whether the two or many enjoy the quality of the same source. In the careful examination of the practical importance of pairwise alignment, the article suggests and illustrates that the best alignment may not necessarily reflect the actual process of evolution. Emphasis lays upon the most important one——general alignment algorithm （Smith Waterman’s algorithm）.Then,the paper puts forward a way by which all the passed routes can be recorded with arrays in the process of alignment,which,by means of recursion,is able to be transferred to a certain use so that the most similar result of alignment can be located. Fianlly many sequences alignment algorithm has also been discussed.

关 键 词：生物信息学 算法 序列比对 

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