A Fast Pattern Matching Algorithm Using Changing Consecutive Characters  

作　　者：Amjad Hudaib Dima Suleiman Arafat Awajan Amjad Hudaib;Dima Suleiman;Arafat Awajan(Department of Computer Information Systems, King Abdullah II for Information Technology, The University of Jorda, Amman, Jordan;Department of Computer Science, King Hussein Faculty of Computer Sciences, Princess Sumaya University for Technology, Amman, Jordan)

机构地区：[1]Department of Computer Information Systems, King Abdullah II for Information Technology, The University of Jorda, Amman, Jordan [2]Department of Computer Science, King Hussein Faculty of Computer Sciences, Princess Sumaya University for Technology, Amman, Jordan

出　　处：《Journal of Software Engineering and Applications》2016年第8期399-411,共13页软件工程与应用（英文）

摘　　要：Pattern matching is a very important algorithm used in many applications such as search engine and DNA analysis. They are aiming to find a pattern in a text. This paper proposes a Pattern Matching Algorithm Using Changing Consecutive Characters (PMCCC) to make the searching pro- cess of the algorithm faster. PMCCC enhances the shift process that determines how the pattern moves in case of the occurrence of the mismatch between the pattern and the text. It enhances the Berry Ravindran (BR) shift function by using m consecutive characters where m is the pattern length. The formal basis and the algorithms are presented. The experimental results show that PMCCC made enhancements in searching process by reducing the number of comparisons and the number of attempts. Comparing the results of PMCCC with other related algorithms has shown significant enhancements in average number of comparisons and average number of attempts.Pattern matching is a very important algorithm used in many applications such as search engine and DNA analysis. They are aiming to find a pattern in a text. This paper proposes a Pattern Matching Algorithm Using Changing Consecutive Characters (PMCCC) to make the searching pro- cess of the algorithm faster. PMCCC enhances the shift process that determines how the pattern moves in case of the occurrence of the mismatch between the pattern and the text. It enhances the Berry Ravindran (BR) shift function by using m consecutive characters where m is the pattern length. The formal basis and the algorithms are presented. The experimental results show that PMCCC made enhancements in searching process by reducing the number of comparisons and the number of attempts. Comparing the results of PMCCC with other related algorithms has shown significant enhancements in average number of comparisons and average number of attempts.

关 键 词：PATTERN Pattern Matching Algorithms String Matching Berry Ravindran EBR RS-A Fast Pattern Matching Algorithms 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]