一个生物系的多序列匹配，包括三种匹配算法，全匹配，两端匹配，局部匹配-Department of Biology, a multi-sequence matching, includes three matching algorithm, full match, both ends of the match, partial match

KMP字符串匹配算法，对字符串进行预处理，复杂度为O(m+n)-KMP string matching algorithm, the string preprocessing complexity is O (m+n)

DNA比对中FASTA算法的简单实现，通过建立查找表、位移表和位移向量表来得出两条序列的最大匹配位移。-DNA matching the FASTA algorithm is simple to achieve, through the establishment of a lookup table, displacement and the displacement vector table to derive maximum matching two sequences displaceme

基因序列匹配算法，可以计算两个基因的最短距离-Gene sequence matching algorithm