给定两个串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

Along with investigating similarity metrics between audio material, the topic of robust matching of pairs of audio content has gained wide interest recently. In particular, if this matching process is carried out using a compact representation

Template matching is concerned with measuring the similarity between patterns of two objects. This paper proposes a massively parallel approach to pattern recognition with a large template set. A class of image recognition problems inherently