並列摘要
The research on the algorithms of pattern-matching is an important subject in the field of computer study. The algorithms can range from single-pattern matching and multi-pattern matching algorithms to extended characters matching and regular expression. Among the many multi-pattern matching algorithms, AC algorithm and WM algorithm would be the two most classical algorithms, but these two algorithms have their obvious shortcomings. The multi-pattern matching algorithm proposed in this paper filtrates the texts which do not match correctly with the idea of jumping ahead of the WM algorithm firstly, and then matches the text with the idea of rapidly matching of the AC algorithm which can improve the efficiency of the algorithm.
參考文獻
Knuth, D. E.,Morris, J. H.,Pratt, V. R.(1974).Fast pattern matching in strings.Stanford, California:Stanford University.
Aho, A.V.,Corasick, M. J.(1975).Efficient string matching: an aid to bibliographic search.Communications of ACM.18(6),333-340.
Boyer, R. S.,Moore, J.S.(1977).A fastest ring searching algorithm.Communications of the ACM.20(10),762-772.
Wu, S.,Manber, U.(1994).A fast algorithm for multi-pattern searching.Report TR-94-17.(Report TR-94-17).,::University of Arizona.
Horspool, R. N.(1980).Practical fast searching in strings.Software-Practice and Experience.10,501-506.
被引用紀錄
徐志豪（2014）。跨攝影機的多汽車追蹤技術〔碩士論文，國立中央大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0031-0605201417534092