Matrix-based parallel pattern matching method

This study presents pattern matching algorithms, based on vector and matrix models that are suitable for parallel pattern matching. On these two models, we further proposed the vector-based single-pattern matching (VBSP) and the matrix-based multi-pattern matching (MBMP) algorithms, as well as the matrix-based multi-pattern approximate (MBMPA) algorithm and the matrix-based multi-pattern exact (MBMPE) algorithm. The G-MBMP algorithm refers to the implementation of the MBMP algorithm on a graphics processing unit (GPU). The performance of the G-MBMPA is better than that of the G-impMASM. The performance of the G-MBMPE is better than that of the G-WM (GPU-based WM algorithm) and that of the G-AC algorithms (GPU-based AC algorithm). The memory of the G-MBMPE algorithm is the least of the three algorithms and is significantly less than that of the G-AC algorithm.