基于关键字树的序列比对算法，用于比对多个相似程度很高的DNA序列，此为复杂度较低的星比对算法。-Keyword-based tree sequence alignment algorithm for more than a high degree of similarity of DNA sequences, this is the low complexity of the star alignment algorithm.

采用Needleman-Wunsch 算法,对两个相似的长序列进行比对. 文件中有2个DNA序列,通过插入空格使得这2个DNA序列等长且尽量的相似.对与插入空格后的2个等长序列,在相同的位置上如果两个字母相同则得1分,不同则得-1分,如果出现空格则得-2分.要求比对的结果得分最高.-use Needleman-Wunsch Algorithm compare and find the best match of two long similar sequences(like DNA)