CPM's 20th anniversary: A statistical retrospective

Elena Yavorska Harris, Thierry Lecroq, Gregory Kucherov, Stefano Lonardi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)


This year the Annual Symposiumon Combinatorial Pattern Matching (CPM) celebrates its 20th anniversary. Over the last two decades the Symposium has established itself as the most recognized international forum for research in combinatorial pattern matching and related applications. Contributions to the conference typically address issues of searching and matching strings and more complex patterns such as trees, regular expressions, graphs, point sets, and arrays. Advances in this field rely on the ability to expose combinatorial properties of the computational problem at hand and to exploit these properties in order to either achieve superior performance or identify conditions underwhich searches cannot be performed efficiently. The meeting also dealswith combinatorial problems in computational biology, data compression, data mining, coding, information retrieval, natural language processing and pattern recognition.

Original languageEnglish
Title of host publicationCombinatorial Pattern Matching - 20th Annual Symposium, CPM 2009, Proceedings
Number of pages11
Publication statusPublished - 2009
Externally publishedYes
Event20th Annual Symposium on Combinatorial Pattern Matching, CPM 2009 - Lille, France
Duration: 22 Jun 200924 Jun 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5577 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference20th Annual Symposium on Combinatorial Pattern Matching, CPM 2009


Dive into the research topics of 'CPM's 20th anniversary: A statistical retrospective'. Together they form a unique fingerprint.

Cite this