Combinatorial Pattern Matching
The papers contained in this volume were presented at the 13th Annual S- posium on Combinatorial Pattern Matching, held July 3â5, 2002 at the Hotel Uminonakamichi, in Fukuoka, Japan. Combinatorial Pattern Matching (CPM) addresses issues of searching and matching strings and more complicated patterns such as trees, regular expr- sions, graphs, point sets, and arrays, in various formats.