摘要： 提出了一种基于串行FastLSA算法的两个序列比对的并行算法。主要是对海量级的序列比对,目的是减少串行FastLSA算法的时间和空间的复杂度。实验结果表明该算法完全可以并行化,而且空间复杂度降到线性空间。

关键词: 并行和串行算法, 序列比对, 线性空间

Abstract: A parallel algorithm based on sequential FastLSA——parallel FastLSA is proposed. It mainly aimes at those sequence alignments with a large number of letter, also, in order to reduce time and space complexity. Experimental results demonstrate that parallel FastLSA can be paralleled entirely, furthmore, reduce the space requirements to linear space.

中图分类号: 

• TP301.6