A fast string-searching algorithm for multiple patterns

Information Processing & Management - Tập 29 Số 6 - Trang 775-791 - 1993
Noriyoshi Uratani1, Masayuki Takeda2
1Science and Technical Research Laboratories, NHK (Japan Broadcasting Corporation), Tokyo 157, Japan
2Interdisciplinary Graduate School of Engineering Science, Kyushu University 39, Kasuga 816, Japan

Tóm tắt

Từ khóa


Tài liệu tham khảo

Aho, 1975, Efficient string matching: An aid to bibliographic search, Communications of the ACM, 18, 333, 10.1145/360825.360855

Apostolico, 1986, The Boyer-Moore-Galil string searching strategies revisited, SIAM Journal on Computing, 15, 98, 10.1137/0215007

Boyer, 1977, A fast string searching algorithm, Communications for the ACM, 20, 762, 10.1145/359842.359859

Commentz-Watler, 1979, A string matching algorithm fast on the average, 71, 118

Galil, 1979, On improving the worst case running time of the Boyer-Moore string matching algorithm, Communications of the ACM, 22, 505, 10.1145/359146.359148

Knuth, 1974, Fast pattern matching in strings

Knuth, 1977, Fast pattern matching in strings, SIAM Journal on Computing, 6, 323, 10.1137/0206024

Kowalski, 1984, New multi-term high speed text search algorithms

Takeda, 1988, A proof of the correctness of Uratani's string searching algorithm

Uratani, 1988, A fast algorithm for matching patterns, IECEJ Technical Report, SS87-27