CPM Archive

The purpose of this page is to serve as a repository of the presentations and other electronic material related to the Combinatorial Pattern Matching (CPM) conferences.

Combinatorial Pattern Matching addresses issues of searching, indexing and matching strings and more complicated structures such as trees, regular expressions, graphs, point sets, arrays, etc. The goal is to derive non-trivial combinatorial properties for such structures and then to exploit these properties in order to achieve improved performance for the corresponding computational problem.