Algorithms for string searching
- 1 April 1989
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGIR Forum
- Vol. 23 (3-4) , 34-58
- https://doi.org/10.1145/74697.74700
Abstract
We survey several algorithms for searching a string in a piece of text. We include theoretical and empirical results, as well as the actual code of each algorithm. An extensive bibliography is also included.Keywords
This publication has 48 references indexed in Scilit:
- VLSI architectures for string matching and pattern matchingPattern Recognition, 1987
- Complete inverted files for efficient text retrieval and analysisJournal of the ACM, 1987
- Algorithms for pattern matchingSoftware: Practice and Experience, 1986
- String-matching cannot be done by a two-head one-way deterministic finite automatonInformation Processing Letters, 1986
- Design of hardware algorithms by recurrence relationsSystems and Computers in Japan, 1985
- Time-space-optimal string matchingJournal of Computer and System Sciences, 1983
- Detection of periodicities and string-matching in real timeJournal of Mathematical Sciences, 1983
- A comparison of three string matching algorithmsSoftware: Practice and Experience, 1982
- String Matching in Real TimeJournal of the ACM, 1981
- Implementation of the substring test by hashingCommunications of the ACM, 1971