Lecture Notes in Computer Science

Vol. 7354: Proceedings of the 23rd Symposium on Combinatorial Pattern Matching. Berlin : Springer, 2012.

Academic editor: J. Karkkainen, J. Stoye

This book constitutes the refereed proceedings of the 23rd Annual Symposium on Combinatorial Pattern Matching, CPM 2012, held in Helsinki, Finalnd, in July 2012. 
The 33 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 60 submissions. The papers address issues of searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays. The goal is to derive non-trivial combinatorial properties of such structures and to exploit these properties in order to either achieve superior performance for the corresponding computational problems or pinpoint conditions under which searches cannot be performed efficiently. The meeting also deals with problems in computational biology, data compression and data mining, coding, information retrieval, natural language processing, and pattern recognition.

Chapters

Cross-Document Pattern Matching

Kucherov G., Nekrich Y., Starikovskaya T., , in: Lecture Notes in Computer ScienceVol. 7354: Proceedings of the 23rd Symposium on Combinatorial Pattern Matching.: Berlin: Springer, 2012. P. 196–207.

We study a new variant of the string matching problem called {\em   cross-document string matching}, which is the problem of indexing a collection of documents to support an efficient search for a pattern in a selected document, where the pattern itself is a substring of another document. Several variants of this problem are considered, ...

Added: October 30, 2013

Keywords: performance, data structures, multiple pattern matching, string algorithms, Computational Complexity