Apostolico–Giancarlo algorithm: Difference between revisions

Revision as of 03:25, 3 June 2012

Revision as of 21:11, 15 January 2013

Line 4:

==References==

*APOSTOLICOApostolico A., GIANCARLOGiancarlo R., 1986, The Boyer-Moore-Galil string searching strategies revisited, [[SIAM Journal on Computing]] 15(1):98-105.

*CROCHEMORECrochemore, M., LECROQLecroq, T., 1997, Tight bounds on the complexity of the Apostolico–Giancarlo algorithm, Information Processing Letters 63(4):195-203.

*CROCHEMORECrochemore, M., RYTTER[[Wojciech Rytter|Rytter, W.]], 1994, Text Algorithms, [[Oxford University Press]].

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

*LECROQLecroq, T., 1992, Recherches de mot, Ph. D. Thesis, [[Orléans|University of Orléans]], France.

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

{{DEFAULTSORT:Apostolico–Giancarlo Algorithm}}