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.
[1]
Moshe Lewenstein,et al.
Cpm 2006
,
2011,
J. Discrete Algorithms.
[2]
Maxime Crochemore,et al.
Indexing and Matching Strings
,
2005
.
[3]
Raffaele Giancarlo,et al.
Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
,
2000
.
[4]
Maxime Crochemore.
String-Matching on Ordered Alphabets
,
1992,
Theor. Comput. Sci..
[5]
Ricardo A. Baeza-Yates,et al.
Proximity Matching Using Fixed-Queries Trees
,
1994,
CPM.
[6]
Laurent Mouchard,et al.
Combinatorial Pattern Matching
,
2007,
J. Discrete Algorithms.
[7]
Gonzalo Navarro,et al.
A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text
,
1999,
CPM.
[8]
Z. Galil,et al.
Combinatorial Algorithms on Words
,
1985
.