求最佳生物序列并置排列的算法和程序

The Program and Algorithm for Optimal Biological Sequence Alignment

本文提出了计算最佳生物序列并置排列的程序和算法。程序使用计算进化距离的改进算法,在IBM-PC/AT上用Turbo-Pascal 4.0版开发。程序有友好的用户界面、操作简便、通用性强,可以移植到多种计算和操作环境。本文以蛋白质分子序列为例,给出了复杂赋权情形下计算进化距离和最佳并置排列的算法,证明了不同赋权方式本质上不改变改进算法的时间和空间复杂性。

In this paper,we present the program and algorithm for optimal biological sequence alignment. The program uses the improved algorithm with Turbo-Pascal (version 4.0) on IBM-PC/AT. The program has features such as friendly user interface, simple operation, general-purpose and portability. This paper describes the algorithm computering evolutionary distance and optimal alignment, for instance protein sequence, in the complex weighing situation. We prove that the distinction of weighing methods do not change the time-complexity and space-complexity of the improved algorithm [11] essentially.