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.
The first CPM conference was held in Paris in 1990. Since then the conference has been organized annually.
Contact: esko.ukkonen@helsinki.fi
Former members: Maxime Crochemore (founding member), Alberto Apostolico (founding member), Zvi Galil, Gadi Landau.