A fast exact string matching algorithms based on greedy jump and QF

Abstract

String matching is a basic problem of computer science and it has been widely used in many important application fields. To date, QF is one of the fastest exact single pattern string matching algorithms for long patterns. In this paper, we improved the QF algorithm by introducing the greedy jump method and gained a serial of exact single pattern string matching algorithms named Greedy QF. Experimental results indicated that Greedy QF is faster than QF in most of case and Greedy QF is faster than other known algorithms in many cases for long patterns on our platform.