Revision as of 18:20, 29 October 2015 edit Glrx (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 29,708 edits →References: +template ← Previous edit		Revision as of 12:10, 30 August 2016 edit undo BiomolecularGraphics4All (talk \| contribs) Extended confirmed users 1,352 edits Add doi(s) to reference(s) Next edit →
Line 4: ==References== Apostolico A., Giancarlo R., 1986, The Boyer-Moore-Galil string searching strategies revisited, [[SIAM Journal on Computing]] 15(1):98-105. [[Digital Object Identifier\|doi]]: [https://dx.doi.org/10.1137/0215007 10.1137/0215007]. 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\|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]. {{Strings}}

Apostolico–Giancarlo algorithm: Difference between revisions