论文标题
快速子字符串匹配的侦察算法
Scout Algorithm For Fast Substring Matching
论文作者
论文摘要
在许多软件应用程序中，确切的子字符串匹配是一项常见的任务。尽管存在几种算法来查找目标字符串中是否存在模式字符串，但最常见的实现是一种幼稚的蛮力方法。替代方法要么不能为增加的复杂性提供足够的好处，要么对于现代角色集不切实际，例如Unicode。我们提出了一种新的算法，即侦察，它对所有应用程序都很简单，快速且合适。我们还将侦察算法的性能特征与其他几个进行比较。
Exact substring matching is a common task in many software applications. Despite the existence of several algorithms for finding whether or not a pattern string is present in a target string, the most common implementation is a naïve, brute force approach. Alternative approaches either do not provide enough of a benefit for the added complexity, or are impractical for modern character sets, e.g., Unicode. We present a new algorithm, Scout, that is straightforward, quick and appropriate for all applications. We also compare the performance characteristics of the Scout algorithm with several others.
