Hybrid pattern-matching algorithm based on BM-KMP algorithm

• Published in: 2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE) Vol. 5; pp. V5-310 - V5-313
• Main Authors: Hou Xian-feng, Yan Yu-bao, Xia Lu
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.08.2010
• Subjects: BM algorithm; hybrid pattern matching; KMP algorithm; KMPBS algorithm; Pattern matching
• ISBN: 1424465397; 9781424465392
• ISSN: 2154-7491
• DOI: 10.1109/ICACTE.2010.5579620

Reading and reference many books and articles, and then analyze and study the KMP algorithm, BM algorithm and a variety of improved algorithms. Summarizes various of the advantages and disadvantages of the pattern matching algorithms and in-depth study the advantages of the algorithms. And on this basis, a new algorithm - KMPBS algorithm is introduced. The algorithm refers to BM algorithm, KMP algorithm and the thinking of improved algorithms. Utilize the last character of the string, the next character and the method to compare from side to side, and then advance a new hybrid pattern matching algorithm. And it adjusted the comparison direction and the order of the comparison to make the maximum moving distance of each time to reduce the pattern matching time. The algorithm reduces the comparison number and greatly reduces the moving number of the pattern and improve the matching efficiency. This algorithm achieved a better result and it works well.