Stringmatchingisoneoftheoldestalgorithmictechniques,yetstilloneofthemostpervasiveincomputerscience.Thepast20yearshaveseentechnologicalleapsinapplicationsasdiverseasinformationretrievalandcompression.Thiscopiouslyillustratedcollectionofpuzzlesandexercisesinkeyareasoftextalgorithmsandcombinatoricsonwordsoffersgraduatestudentsandresearchersapleasantanddirectwaytolearnandpracticewithadvancedconcepts.Theproblemsaredrawnfromalargerangeofscientificpublications,bothclassicandnew.Buildingupfromthebasics,thebookgoesontoshowcaseproblemsincombinatoricsonwords(includingFibonacciorThue-Morsewords),patternmatching(includingKnuth-Morris-PrattandBoyer-Moorelikealgorithms),efficienttextdatastructures(includingsuffixtreesandsuffixarrays),regularitiesinwords(includingperiodsandruns)andtextcompression(includingHuffman,Lempel-ZivandBurrows-Wheelerbasedmethods).
