The annual CPM meeting which provides an international forum for research in combinatorial pattern matching and related applications is discussed. It addresses issues of searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays. The meeting also deals with problems in computational biology, data compression, data mining, coding, information retrieval, and natural language processing and pattern recognition. The first twenty one meetings were held in Paris, London, Tucson, Padova, Asilomar, Helsinki, Laguna Beach, Aarhus and Piscataway. Twenty five extended abstracts were chosen after a refereeing process, and three presentations were invited to the conference.
Bibliographical noteFunding Information:
The papers contained in this issue were chosen from the abstracts presented at the 19th Annual Symposium on Combinatorial Pattern Matching, held July 18–20, 2009, at the Department of Computer Science of the University of Pisa, Italy. The conference was supported by the University of Pisa and Yahoo! Research.
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)