|
==References==
* Apostolico{{cite A., Giancarlojournal R|doi=10., 1986,1137/0215007 |title=The Boyer–Moore–Galil stringString searchingSearching strategiesStrategies revisited,Revisited |year=1986 |last1=Apostolico |first1=Alberto |last2=Giancarlo |first2=Raffaele |journal=[[SIAM Journal on Computing]] |volume=15(1): |pages=98–105. {{doi|10url=https://docs.1137lib.purdue.edu/0215007cgi/viewcontent.cgi?article=1456&context=cstech}}.
* Crochemore,{{cite M.,journal Lecroq, T|doi=10., 1997,1016/S0020-0190(97)00107-5 |title=Tight bounds on the complexity of the Apostolico–GiancarloApostolico-Giancarlo algorithm, |year=1997 |last1=Crochemore |first1=Maxime |last2=Lecroq |first2=Thierry |journal=[[Information Processing Letters]] |volume=63( |issue=4): |pages=195–203. {{doi|10.1016url=https:/S0020/hal-0190(97)00107upec-5upem.archives-ouvertes.fr/hal-00619574/file/ipl2.pdf}}.
* {{cite book |last=Crochemore, |last=M., [[Wojciech Rytter|last2=Rytter, |first2=W.]], |author2-link=Wojciech Rytter |year=1994, |title=Text Algorithms, |publisher=[[Oxford University Press]].}}
* {{cite book |last=Gusfield, |first=D., |year=1997, |title=Algorithms on stringsStrings, treesTrees, and sequencesSequences: Computer Science and Computational Biology, |publisher=[[Cambridge University Press]]. {{ISBN|isbn=0-521-58519-8}}.
* {{cite thesis |last=Lecroq, |first=T., |year=1992, |title=Recherches de mot,Mots |type=Ph. D. Thesis, |publisher=[[Orléans|University of Orléans]], France.}}
* Lecroq,{{cite T.,journal 1995,|doi=10.1002/spe.4380250703 |title=Experimental results on string matching algorithms, Software|year=1995 –|last1=Lecroq |first1=Thierry |journal=[[Software: Practice &and Experience]] |volume=25( |issue=7): |pages=727–765. {{doi|10.1002/spe.4380250703s2cid=15253073}}.
{{Strings}}
|
