Apostolico–Giancarlo algorithm: Difference between revisions

Revision as of 20:15, 12 October 2009

Revision as of 14:21, 13 April 2010

Line 1:

{{Intro-rewrite|date=September 2009}}

'''Apostolico-GiancarloApostolico–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.

==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-GiancarloApostolico–Giancarlo algorithm, Information Processing Letters 63(4):195-203.

*CROCHEMORE, M., RYTTER, W., 1994, Text Algorithms, [[Oxford University Press]].

*GUSFIELD, D., 1997, Algorithms on strings, trees, and sequences: [[Computer science|Computer Science]] and Computational Biology, [[Cambridge University Press]].

Line 11:

*LECROQ, T., 1995, Experimental results on [[String searching algorithm|string matching]] algorithms, Software - Practice & Experience 25(7):727-765.

{{DEFAULTSORT:Apostolico-GiancarloApostolico–Giancarlo Algorithmalgorithm}}

[[Category:Algorithms on strings]]