Category: String
Journal: SIGIR Forum
Abstract: Introduces a family of simple and fast algorithms for
        solving the classical string matching problem, string
        matching with don't care symbols and complement
        symbols, and multiple patterns. The same problems are
        solved allowing up to k mismatches. These algorithms
        are real time algorithms, they don't need to buffer
        the input, and they are suitable for implementation
        in hardware
Number: 1,2
Bibtype: Article
Booktitle: 12th Annual International ACMSIGIR Conference on
        Research and Development in Information Retrieval
Author: Ricardo A. Baeza-Yates
        G. H. Gonnet
Pages: 168-175
Month: jun
Title: A New Approach To Text Searching
Year: 1989
Volume: 23
Keyword: algorithm theory; database theory; information
        retrieval; text searching; fast algorithms; string
        matching problem; don't care symbols; complement
        symbols; multiple patterns; mismatches; real time
        algorithms