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.
| ISBN: | 9783319075655 |
| Publication date: | 21st May 2014 |
| Author: | CPM Symposium |
| Publisher: | Springer an imprint of Springer International Publishing |
| Format: | Paperback |
| Pagination: | 283 pages |
| Series: | Lecture Notes in Computer Science |
| Genres: |
Pattern recognition Maths for computer scientists Numerical analysis Computational biology / bioinformatics Algorithms and data structures Discrete mathematics Databases |
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.
Combinatorial Pattern Matching features in the following genres: Pattern recognition, Maths for computer scientists, Numerical analysis, Computational biology / bioinformatics, Algorithms and data structures, Discrete mathematics, Databases
Combinatorial Pattern Matching is available in Paperback
Combinatorial Pattern Matching was written by CPM Symposium and published by Springer an imprint of Springer International Publishing
Combinatorial Pattern Matching has 283 pages
Yes it is part of Lecture Notes in Computer Science series