Content deleted Content added
m Adding a few internal links from an online link suggesting tool. |
No edit summary |
||
Line 3:
== References ==
*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-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]].
*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.
| |||