Abstract
String-matching algorithm is one of the most researched algorithms in computer science which has become an important factor in many technologies. This field aims at utilizing the least time and resources to find desired sequence of character in complex data content. The most classical and famous string-search algorithms are Knuth-Morris-Pratt (KMP) algorithm and Boyer-Moore (DM) algorithm. These two algorithms provide efficient heuristic jump rules by prefix or suffix. Bitap algorithm was the first to introduce bit-parallelism into string-matching field. Backward Non-Deterministic DAWG Matching (BNDM) algorithm is a modern practical algorithm that is an outstanding combination of theoretical research and practical application. Those meaningful algorithms play a guiding role in future research in string-search algorithm to improve the average performance of the algorithm and reduce resource consumption.
Reference13 articles.
1. Fast Pattern Matching in Strings
2. Hou Xian-feng, Yan Yu-bao and Xia Lu, “Hybrid pattern-matching algorithm based on BM-KMP algorithm, ” 2010 3rd International Conference on Advanced Computer Theory and Engineering (ICACTE), 2010, pp. V5-310-V5-313, doi: 10.1109/ICACTE.2010.5579620.
3. Michael Maher, “How tp Extend Partial Deduction to Derive the KMP String-Matching Algorithm from a Naive Specification, ” in Logic Programming: Proceedings of the 1996 Joint International Conference and Symposium on Logic Programming, MIT Press, 1996, pp.539-539.
4. A fast string searching algorithm
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Performance Comparison of String Matching Methods for Consumer Data Retrieval;2023 17th International Conference on Telecommunication Systems, Services, and Applications (TSSA);2023-10-12