When I was at the University of Wales (Bangor) a colleague of mine wrote a comprehensive survey report on string searching. (He later turned this into a book, now published.) The technical report covers all the algorithms you went over briefly in class, and includes worked examples. It also covers approximate string matching, longest common subsequences, and so on. (Everything you ever wanted to know about string searching but were afraid to ask.:) The technical report is available via anonymous ftp from venus.sees.bangor.ac.uk in pub/graham. I have retrieved a copy (in PostScript and DVI format), which I have placed in my home directory on fox (/home/paul), should you like to peruse it. It is also available via anonymous ftp from csgrad.cs.vt.edu in pub/paul, for those who do not have accounts on fox.