Combinatorial Pattern Matching 23rd Annual Symposium, CPM 2012, Helsinki, Finland, July 3-5, 2012, Proceedings / [electronic resource] :
edited by Juha Kärkkäinen, Jens Stoye.
- 1st ed. 2012.
- XIII, 454 p. 82 illus. online resource.
- Theoretical Computer Science and General Issues, 7354 2512-2029 ; .
- Theoretical Computer Science and General Issues, 7354 .
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.
9783642312656
10.1007/978-3-642-31265-6 doi
Pattern recognition systems.
Algorithms.
Numerical analysis.
Computer science--Mathematics.
Discrete mathematics.
Artificial intelligence--Data processing.
Bioinformatics.
Automated Pattern Recognition.
Algorithms.
Numerical Analysis.
Discrete Mathematics in Computer Science.
Data Science.
Computational and Systems Biology.
Q337.5 TK7882.P3
006.4
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.
9783642312656
10.1007/978-3-642-31265-6 doi
Pattern recognition systems.
Algorithms.
Numerical analysis.
Computer science--Mathematics.
Discrete mathematics.
Artificial intelligence--Data processing.
Bioinformatics.
Automated Pattern Recognition.
Algorithms.
Numerical Analysis.
Discrete Mathematics in Computer Science.
Data Science.
Computational and Systems Biology.
Q337.5 TK7882.P3
006.4