资 源 简 介
给定两个串S和T，长分别m和n，本文给出了一个找出二串间最大匹配的算法。该算法可
用于比较两个串S和T的相似程度，它与串的模式匹配有别-given two series of S and T, length m and n, the paper presents a series of two to identify the largest matching algorithm. The algorithm can be used to compare two strings S and T degree of similarity, and strings of pattern matching different
