Fastest pattern matching in strings

作者： L. Colussi

DOI: 10.1006/JAGM.1994.1008

关键词: Axiomatic semantics 、 Pattern matching 、 Strategy 、 Ramer–Douglas–Peucker algorithm 、 Mathematics 、 Preprocessor 、 Boyer–Moore string search algorithm 、 Character (computing) 、 Algorithm 、 Order (group theory)

摘要: An algorithm is presented that substantially improves the algorithm of Boyer and Moore for pattern matching in strings, both in the worst case and in the average. Both the Boyer and …