CPM's 20th Anniversary: A Statistical Retrospective

  • Authors:

  • Elena Yavorska Harris;Thierry Lecroq;Gregory Kucherov;Stefano Lonardi

  • Affiliations:

  • Dept. of Computer Science, University of California, Riverside, USA;University of Rouen, Mont-Saint-Aignan Cedex, France 76821;CNRS (LIFL, Lille and J.-V.Poncelet Lab, Moscow) and INRIA Lille --- Nord Europe,;Dept. of Computer Science, University of California, Riverside, USA

  • Venue:
  • CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.