S. MUTHUKRISHNAN and Suleyman Cenk Sahinalp Bell Labs, Lucent Technologies, USA and Department of Computer Science, University of Warwick, UK muthu@research.bell-labs.com and jenk@cassandra.humgen.upenn.edu In 25 years since the classical paper of Knuth, Morris and Pratt
on string matching, the area of Combinatorial Pattern Matching
has matured tremendously drawing motivation from Formal Languages,
Compilers, Text Compression, Databases and digital libraries,
Text Editors etc. In the past five years, there has been a surge
of interesting results leading not only to the solution of some
outstanding open problems in this area but also to the formulation
of many promising new directions and problems. Also new application
areas have emerged such as Computational Biology and Data Mining. With the hindsight of these developments, we will discuss the
core techniques for string processing that have been identified
in the area of Combinatorial Pattern Matching. Our focus will
be on fundamental results and novel applications.
Computation
COMBINATORIAL PATTERN MATCHING: TECHNIQUES AND APPLICATIONS
Advanced course
Second week
Course description
Prerequisites
None
Literature
No specific recommendation