Reverse Colussi algorithm反向Colussi演算法.ppt

Reverse Colussi algorithm Fastest pattern matching in strings, Colussi, L. Journal of Algorithms, Vol. 16 , No. 2, 1994, pp.163-189 Advisor: Prof. R. C. T. Lee Speaker: Y. K. Shie The Reverse Colussi Algorithm is an algorithm which solves the string matching problem and it is in the spirit of the original Colussi Algorithm.. The Main Points of the Reverse Colussi Algorithm 1. It changes the bad character rule from matching one character to matching a pair of characters. Reverse Colussi algorithm divides the position into special position and non-special position. Special position allow smaller number of jump. The Reverse Colussi Algorithm processes the special position first. Note that the Colussi Algorithm does not consider all of the positions where the prefix function assumes value -1. That this can be done can be seen by the following fact: The position where prefix function assumes -1 allows the largest number of steps to shift. Thus the Colussi Algorithm examines all positions which allow smaller number of steps of shift which is a safe action. Ti is the ith character in T (1≦i≦n). Pj are the jth character in P (1≦j≦m). The bad character rule is like the Rule 2-1, Character Matching Rule. Rule 2-1: Character Matching Rule(A Special Version of Rule 2) For any character x in T, find the nearest x in P which is to the left of x in T. Implication of Rule 2-1 Case 1. If there is an x in P to the left of T, move P so that the two x’s match. Case 2: If no such an x exists in P, consider the partial window defined by x in T and the string to the left of it. rcBc table rcBc table rcBc table rcBc table rcBc table rcBc table Y is the last character of the windows of T. s is the length which we shift in last step. k is an integer. case 1: If we can find Pm-k-1=Y and Pm-k-s-1=Pm-s-1, we fill the minimal k into rcBc[Y, s]. case 2: If we can find Pm-k-1=Y and km-s-1, we fill the minimal k into rcBc[Y, s