Revision as of 07:04, 27 October 2016 edit Mark viking (talk \| contribs) Extended confirmed users 19,326 edits m clean up using AWB ← Previous edit		Revision as of 08:51, 3 December 2016 edit undo Yobot (talk \| contribs) Bots 4,733,870 edits m →References: ISBN sytax fixes, replaced: ISBN → ISBN using AWB Next edit →
Line 7: Crochemore, M., Lecroq, T., 1997, Tight bounds on the complexity of the Apostolico–Giancarlo algorithm, Information Processing Letters 63(4):195-203. [[Digital Object Identifier\|doi]]: [https://dx.doi.org/10.1016/S0020-0190(97)00107-5 10.1016/S0020-0190(97)00107-5]. Crochemore, M., [[Wojciech Rytter\|Rytter, W.]], 1994, Text Algorithms, [[Oxford University Press]]. Gusfield, D., 1997, Algorithms on strings, trees, and sequences: Computer Science and Computational Biology, [[Cambridge University Press]]. ~~[[International Standard Book Number\|~~ISBN]] 0-521-58519-8. Lecroq, T., 1992, Recherches de mot, Ph. D. Thesis, [[Orléans\|University of Orléans]], France. *Lecroq, T., 1995, Experimental results on [[String searching algorithm\|string matching]] algorithms, Software - Practice & Experience 25(7):727-765. [[Digital Object Identifier\|doi]]: [https://dx.doi.org/10.1002/spe.4380250703 10.1002/spe.4380250703].

Apostolico–Giancarlo algorithm: Difference between revisions