Fast algorithms for two-dimensional and multiple pattern matching (preliminary version)

作者: Ricardo A. Baeza-Yates , Mireille Régnier

DOI:

关键词: Approximate string matchingPattern matchingArtificial intelligence3-dimensional matchingPattern recognitionCommentz-Walter algorithmMathematicsBitap algorithmOptimal matchingBoyer–Moore string search algorithmAlgorithm

摘要:

参考文章(14)
Mireille Regnier, Knuth-Morris-Pratt Algorithm: An Analysis mathematical foundations of computer science. pp. 431- 444 ,(1989) , 10.1007/3-540-51486-4_90
Beate Commentz-Walter, A String Matching Algorithm Fast on the Average international colloquium on automata, languages and programming. pp. 118- 132 ,(1979) , 10.1007/3-540-09510-1_10
Ricardo A. Baeza-Yates, String Searching Algorithms Revisited workshop on algorithms and data structures. pp. 75- 96 ,(1989) , 10.1007/3-540-51542-9_9
Richard M. Karp, Michael O. Rabin, Efficient randomized pattern-matching algorithms Ibm Journal of Research and Development. ,vol. 31, pp. 249- 260 ,(1987) , 10.1147/RD.312.0249
Ricardo A. Baeza-Yates, Gaston H. Gonnet, Mireille Régnier, Analysis of Boyer-Moore-type string searching algorithms symposium on discrete algorithms. pp. 328- 343 ,(1990) , 10.5555/320176.320219
Wojciech Rytter, A Correct Preprocessing Algorithm for Boyer–Moore String-Searching SIAM Journal on Computing. ,vol. 9, pp. 509- 512 ,(1980) , 10.1137/0209037
R.S. Bird, Two dimensional pattern matching Information Processing Letters. ,vol. 6, pp. 168- 170 ,(1977) , 10.1016/0020-0190(77)90017-5
Donald E Knuth, James H Morris, Jr, Vaughan R Pratt, Fast Pattern Matching in Strings SIAM Journal on Computing. ,vol. 6, pp. 323- 350 ,(1977) , 10.1137/0206024
R. Nigel Horspool, Practical Fast Searching in Strings Software - Practice and Experience. ,vol. 10, pp. 501- 506 ,(1980) , 10.1002/SPE.4380100608
Rui Feng Zhu, Tadao Takaoka, A technique for two-dimensional pattern matching Communications of the ACM. ,vol. 32, pp. 1110- 1120 ,(1989) , 10.1145/66451.66459