String searching algorithms We will cover all the main paradigms to search strings with and without mistakes, from classical ones such as Knuth-Morris-Pratt and Boyer-Moore to algorithms based in bit parallelism such as shitf-ot and shift-and. The first part will be conceptual mentioning applications to the Web ana other type of data, while the second part will be more technical.
Ricardo Baeza-Yates received his Ph.D. in CS from U. of Waterloo, Canada, in 1989. During 1993, he received the Organization of American States award for young researchers in exact sciences. In 1994 obtained the Chilean Engineers Institute award for his research work. In 1997, with two Brazilian colleagues obtained the COMPAQ prize to the best Brazilian CS research article in 1996. In 2002 was the first computer scientist incorporated to the Chilean Academy of Sciences. He is the current president of CLEI (Latin American CS Association) and member of the board of governors of the IEEE-CS. Currently he is professor and chair of the CS department at the University of Chile, as well as director of the Center for Web Research. Among other publications, he is co-author of Modern Information Retrieval (Addison-Wesley, 1999) and the 2nd edition of the Handbook of Algorithms and Data Structures (Addison-Wesley, 1991), and co-editor of Information Retrieval: Algorithms and Data Structures (Prentice-Hall, 1992). His research interests include algorithms and data structures, text retrieval, web mining, and visualization applied to databases. He is member of the ACM, EATCS, IEEE (senior), SCCC and SIAM. [http://www.dcc.uchile.cl/~rbaeza/]