Combinatorial Pattern Matching

Kulikov, Alexander S.

Combinatorial Pattern Matching 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings / [electronic resource] : edited by Alexander S. Kulikov, Sergei O. Kuznetsov, Pavel Pevzner. - XXII, 283 p. 38 illus. online resource. - Lecture Notes in Computer Science, 8486 0302-9743 ; . - Lecture Notes in Computer Science, 8486 .

Trees -- Regular expressions -- Graphs -- Point sets -- Arrays.

This book constitutes the refereed proceedings of the 25th Annual Symposium on Combinatorial Pattern Matching, CPM 2014, held in Moscow, Russia, in June 2014. The 28 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 54 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 combinatorial properties of such structures and to exploit these properties in order to achieve superior performance for the corresponding computational problems. The meeting also deals with problems in computational biology; data compression and data mining; coding; information retrieval; natural language processing; and pattern recognition.

9783319075662

10.1007/978-3-319-07566-2 doi


Computer science.
Data structures (Computer science).
Computer software.
Electronic data processing.
Computational complexity.
Optical pattern recognition.
Bioinformatics.
Computer Science.
Pattern Recognition.
Algorithm Analysis and Problem Complexity.
Numeric Computing.
Discrete Mathematics in Computer Science.
Data Structures.
Computational Biology/Bioinformatics.

Q337.5 TK7882.P3

006.4

Maintained by VTU Library