R. A. Baeza-Yates. Improved string searching. Softw. Pract. Exp., 19(3):257-271, 1989. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
New Experimental Results on Exact String-Matching - Lecroq (Correct)
....by scanning, at each attempt, the characters of the window from right to left, recognizing some sux of the pattern, performing a shift and thus, in most cases, avoiding to look at all the characters of the text. Several experiments on exact string matching have already been reported ( 3] 4] [5], 6] 7] 8] 9] and [10] In this article we compare the performances of three di erent implementations of the Boyer Moore algorithm, namely the Tuned Boyer Moore algorithm [7] the Quick Search algorithm [11] and the Berry Ravindran algorithm [9] with algorithms using trees or automata to ....
R. A. Baeza-Yates. Improved string searching. Softw. Pract. Exp., 19(3):257-271, 1989.
Agrep - A Fast Approximate Pattern-Matching Tool - Wu, Manber (1992) (59 citations) (Correct)
....lines of source code, angles between edges in polygons, machines or machine parts in a production schedule, music notes and tempo in a musical score, etc. The two most famous algorithms for this problem are the Knuth Morris Pratt algorithm [KMP77] and the Boyer Moore algorithm [BM77] see also [Ba89] and [HS91] There are many extensions to this problem; for example, we may be looking for a set of patterns, a regular expression, a pattern with wild cards, etc. String searching in Unix is most often done with the grep family. In some instances, however, the pattern and or the text are not ....
Baeza-Yates R. A., "Improved string searching," Software --- Practice and Experience 19 (1989), pp. 257-271.
A Fast Algorithm For Multi-Pattern Searching - Wu, Manber (1994) (13 citations) (Correct)
....the Boyer Moore technique with the Aho Corasick algorithm. The CommentzWalter algorithm is substantially faster than the Aho Corasick algorithm in practice. Hume [Hu91] designed a tool called gre based on this algorithm, and version 2.0 of fgrep by the GNU project [Ha93] is using it. Baeza Yates [Ba89] also gave an algorithm that combines the Boyer Moore Horspool algorithm [Ho80] which is a slight variation of the classical Boyer Moore algorithm) with the Aho Corasick algorithm. We present a different approach that also uses the ideas of Boyer and Moore. Our algorithm is quite simple, and the ....
Baeza-Yates R. A., "Improved string searching," Software --- Practice and Experience 19 (1989), pp. 257-271.
A Fast Multiple String-Pattern Matching Algorithm - Kim, Kim (1999) (3 citations) (Correct)
No context found.
Beaza-Yates, R. A., "Improved string searching" Software -- Practice and Experience, 19, (1989), 257-271
The Efficient Implementation of Common Lisp's SEARCH Function on.. - Baker (1989) (Correct)
No context found.
Baeza-Yates, Ricardo A. "Improved String Searching". SW---Prac. & Exper. 19,3 (March 1989), 257-271.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC