Quick Search Algorithm. A very fast substring search algorithm, SUNDAY D.M., Communications of the ACM . 33(8),1990, pp. 132-142. Adviser: R. C. T. Lee Speaker: C. W. Cheng National Chi Nan University. Problem Definition.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
A very fast substring search algorithm, SUNDAY D.M., Communications of the ACM . 33(8),1990, pp. 132-142.
Adviser: R. C. T. Lee
Speaker: C. W. Cheng
National Chi Nan University
Input: a text string T with length n and a pattern string P with length m.
Output: all occurrences of P in T.
Suppose that P1 is aligned to Ts now, and we perform a pair-wise comparing between text T and pattern P from left to right. Assume that the first mismatch occurs when comparing Tq with Pp .
Since Tq ≠Pp , we move the pattern P to right such that the largest position i in the right of Pi is equal to Ts+m. We can shift the pattern at least (m-i) positions right.
s + m
7 6 5 4 3 2 1
[KMP77] Fast pattern matching in strings, D. E. Knuth, J. H. Morris, Jr and V. B. Pratt, SIAM J. Computing, 6,
1977, pp. 323–350.
[BM77] A fast string search algorithm, R. S. Boyer and J. S. Moore, Comm. ACM, 20, 1977, pp. 762–772.
[S90] A very fast substring search algorithm, D. M. Sunday, Comm. ACM, 33, 1990, pp. 132–142.
[RR89] The Rand MH Message Handling system: User’s Manual (UCIVersion), M. T. Rose and J. L. Romine,
University of California, Irvine, 1989.
[S82] A comparison of three string matching algorithms, G. De V. Smith, Software—Practice and Experience,12,
1982, pp. 57–66.
[HS91] Fast string searching, HUME A. and SUNDAY D.M. , Software - Practice & Experience 21(11), 1991, pp.
[S94] String Searching Algorithms , Stephen, G.A., World Scientific, 1994.
[ZT87] On improving the average case of the Boyer-Moore string matching algorithm, ZHU, R.F. and
TAKAOKA, T., Journal of Information Processing 10(3) , 1987, pp. 173-177 .
[R92] Tuning the Boyer-Moore-Horspool string searching algorithm, RAITA T., Software - Practice & Experience,
22(10) , 1992, pp. 879-884.
[S94] On tuning the Boyer-Moore-Horspool string searching algorithms, SMITH, P.D., Software - Practice &
Experience, 24(4) , 1994, pp. 435-436.
[BR92] Average running time of the Boyer-Moore-Horspool algorithm, BAEZA-YATES, R.A., RÉGNIER, M.,
Theoretical Computer Science 92(1) , 1992, pp. 19-31.
[H80] Practical fast searching in strings, HORSPOOL R.N., Software - Practice & Experience, 10(6) , 1980, pp.
[L95] Experimental results on string matching algorithms, LECROQ, T., Software - Practice & Experience 25(7) ,
1995, pp. 727-765.