FAST STRING-MATCHING WITH MISMATCHES

被引：14

作者：

BAEZAYATES, RA ^{[1
]}

GONNET, GH ^{[1
]}

机构：

[1] SWISS FED INST TECHNOL, CH-8092 ZURICH, SWITZERLAND

来源：

INFORMATION AND COMPUTATION | 1994年 / 108卷 / 02期

关键词：

D O I：

10.1006/inco.1994.1007

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We describe and analyze three simple and fast algorithms on the average for solving the problem of string matching with a bounded number of mismatches. These are the naive algorithm, an algorithm based on the Boyer-Moore approach, and ad hoc deterministic finite automata searching. We include simulation results that compare these algorithms to previous works. (C) 1994 Academic Press, Inc.

引用

页码：187 / 199

页数：13

共 15 条

[1] GENERALIZED STRING MATCHING [J].