An improved algorithm of multiple pattern matching

Combined with the advantages of the BM algorithm, an improved, faster algorithm of multiple pattern matching is put forward based on the AQR algorithm. The proposed algorithm skips as many characters as possible by making full use of position information of the last failed matching to achieve a higher performance. The experiments and analysis show that the proposed algorithm has a better performance than the AQR algorithm, especially when characters occur repeatedly in the target text but its occurrence probability in pattern strings is small.