摘要: We survey several algorithms for searching a string in piece of text. include theoretical and empirical results, as well the actual code each algorithm. An extensive bibliography is also included.
acm.org
sci-hub.se 参考文章(57)
Ricardo Alberto Baeza-Yates, Efficient text searching Efficient text searching. pp. 1- 1 ,(1989)
Mireille Regnier, Knuth-Morris-Pratt Algorithm: An Analysis mathematical foundations of computer science. pp. 431- 444 ,(1989) , 10.1007/3-540-51486-4_90
Alfred V. Aho, Pattern Matching in Strings Formal Language Theory#R##N#Perspectives and Open Problems. pp. 325- 347 ,(1980) , 10.1016/B978-0-12-115350-2.50016-6
Maxime Crochemore, Dominique Perrin, Pattern Matching in Strings Image Analysis and Processing II. pp. 67- 79 ,(1988) , 10.1007/978-1-4613-1007-5_6
Ming Li, Lower Bounds on String-Matching Cornell University. ,(1984)
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
Maxime Crochemore, String matching with constraints Lecture Notes in Computer Science. pp. 44- 58 ,(1988) , 10.1007/BFB0017130
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
Gerhard Barth, An alternative for the implementation of the Knuth-Morris-Pratt algorithm Information Processing Letters. ,vol. 13, pp. 134- 137 ,(1981) , 10.1016/0020-0190(81)90042-9
Omer Berkman, Dany Breslauer, Zvi Galil, Baruch Schieber, Uzi Vishkin, Highly parallelizable problems Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89. pp. 309- 319 ,(1989) , 10.1145/73007.73036