Content deleted Content added
add intro-rewrite template, no background is given |
m →References: Date maintenance tags and general fixes |
||
Line 2:
'''Apostolico-Giancarlo algorithm''' - an algorithm which remembers the length of the longest suffix of the pattern ending at the right position of the window at the end of each attempt. These information are stored in a table skip. It was designed by Apostolico and Giancarlo.
==
*APOSTOLICO A., GIANCARLO R., 1986, The Boyer-Moore-Galil string searching strategies revisited, [[SIAM Journal on Computing]] 15(1):98-105.
*CROCHEMORE, M., LECROQ, T., 1997, Tight bounds on the complexity of the Apostolico-Giancarlo algorithm, Information Processing Letters 63(4):195-203.
Line 10:
*LECROQ, T., 1995, Experimental results on [[String searching algorithm|string matching]] algorithms, Software - Practice & Experience 25(7):727-765.
{{DEFAULTSORT:Apostolico-Giancarlo Algorithm}}
[[Category:Algorithms on strings]]
| |||