Apostolico–Giancarlo algorithm: Difference between revisions

Revision as of 14:22, 13 April 2010

Revision as of 23:47, 23 December 2010

Line 1:

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

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

Line 11:

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

{{DEFAULTSORT:Apostolico–Giancarlo algorithmAlgorithm}}

[[Category:Algorithms on strings]]