Category: String
Organization: Dept. of Comput. Sci., Waterloo Univ., Ont.,
        Canada 
Journal: SIGIR Forum
Comment: BM,KMP等の比較
Abstract: Several algorithms for searching a string in a piece
        of text are surveyed. Theoretical and empirical
        results, as well as the actual code of each
        algorithm, are provided. The actual string matching
        algorithms are: naive algorithm, Knuth-Morris-Pratt
        algorithm (D.E. Knuth et al., 1977), different
        variants of the Bayer-Moore algorithm (R. Boyer, S.
        Moore, 1977), shifter algorithm (R.A. Baeza-Yates et
        al., 1989) and the Karp-Rabin algorithm (R. Karp, M.
        Rabin, 1987)
Number: 3,4
Bibtype: Article
Author: Ricardo A. Baeza-Yates
Pages: 34-58
Month: spring/summer
Title: Algorithms for String Searching: A Survey
Year: 1989
Volume: 23
Keyword: information retrieval systems; pattern recognition;
        word processing; string searching; text; empirical
        results; string matching algorithms; naive algorithm;
        Knuth-Morris-Pratt algorithm; Bayer-Moore algorithm;
        shifter algorithm; Karp-Rabin algorithm