Combinatorial pattern matching

More about the book

This volume contains papers presented at the 13th Annual Symposium on Combinatorial Pattern Matching, held from July 3–5, 2002, in Fukuoka, Japan. Selected from 37 submitted abstracts, the papers explore various aspects of searching and matching strings and complex patterns, including trees, regular expressions, graphs, point sets, and arrays. The aim is to uncover non-trivial combinatorial properties of these structures and leverage them to enhance performance in computational problems. Additionally, the research addresses the properties and conditions that hinder efficient searches. Over the past decade, this field has evolved from isolated findings into a robust area of algorithmics, driven by the growing need for speed and efficiency in applications such as the World Wide Web, computational biology, computer vision, and multimedia systems. These applications demand effective information retrieval from diverse databases, data compression, and pattern recognition. The annual CPM gathering serves as an international platform for advancing research in combinatorial pattern matching and its related applications.