Apostolico–Giancarlo algorithm: Difference between revisions

Revision as of 19:25, 21 August 2011

Revision as of 02:11, 5 December 2011

Line 1:

{{context}}

{{Lead rewrite|date=September 2009}}

In [[computer science]], the '''Apostolico–Giancarlo algorithm''' is 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 Alberto Apostolico and Raffaele Giancarlo.

==References==

{{Reflist}}

*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.