An improved algorithm for boyer-moore string matching in chinese information processing
2011pp. 182–184
Citations Over Time
Abstract
BM string matching algorithm is the most famous and efficient in the model matching. Based on it, this article made use of the continuous series of characters which are not in the model string need not be compared to change the model string comparing order. The results indicated that the improvement algorithm for BM string matching which proposed by this article can efficiently decrease the time of string matching and comparing, improve the efficiency string matching algorithm.
Related Papers
- → Comparison of Two-Dimensional String Matching Algorithms(2012)9 cited
- → Exact and like string matching algorithm for web and network security(2013)5 cited
- → An improved algorithm for boyer-moore string matching in chinese information processing(2011)5 cited
- → Novel approach for string searching and matching using American standard code for information interchange value(2016)1 cited
- → Effects of Suffix Repetition Rates of a String on the Performance of String Matching Algorithms(2009)