A New Multi-pattern Matching Algorithm Based on Frequently Used Group

Along with the rapid development of computer technology, people´s lives are increasingly dependent on computers. At the same time, the computer system is facing increasingly complex and diverse sabotage and attacks. Destruction of computer viruses is most widespread and severe among them, so studying anti-virus technology is imminent. Virus scanning engine is the kernel of anti-virus software, it uses signature database to identify known viruses. The pattern matching algorithm is the core algorithm of the entire anti-virus software. This paper first introduces some background knowledge of anti-virus software, pattern matching algorithm and hash algorithm. Then it proposes a new type of multi-pattern matching algorithm with automata based on frequently matching hash values. Combining the advantages of fast calculation of hash function and parallel pattern matching of automata, it has significant performance advantages in the circumstance of virus signature matching. It can also be applied to other similar circumstances after making a little improvement, such as gene sequence alignment where patterns are also very long.