Combinatorial Pattern Matching 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings / [electronic resource] :
edited by Johannes Fischer, Peter Sanders.
- X, 259 p. 58 illus. online resource.
- Lecture Notes in Computer Science, 7922 0302-9743 ; .
- Lecture Notes in Computer Science, 7922 .
Searching and matching strings and more complicated patterns.- Trees, regular expressions, graphs, point sets, and arrays.- Non-trivial combinatorial properties of such structures.- Problems in computational biology -- Data compression and data mining -- Coding -- Information retrieval -- Natural language processing -- Pattern recognition.
This book constitutes the refereed proceedings of the 24th Annual Symposium on Combinatorial Pattern Matching, CPM 2013, held in Bad Herrenalb (near Karlsruhe), Germany, in June 2013. The 21 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 51 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 problem 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.
9783642389054
10.1007/978-3-642-38905-4 doi
Computer science.
Data structures (Computer science).
Algorithms.
Numerical analysis.
Computer science--Mathematics.
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
Searching and matching strings and more complicated patterns.- Trees, regular expressions, graphs, point sets, and arrays.- Non-trivial combinatorial properties of such structures.- Problems in computational biology -- Data compression and data mining -- Coding -- Information retrieval -- Natural language processing -- Pattern recognition.
This book constitutes the refereed proceedings of the 24th Annual Symposium on Combinatorial Pattern Matching, CPM 2013, held in Bad Herrenalb (near Karlsruhe), Germany, in June 2013. The 21 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 51 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 problem 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.
9783642389054
10.1007/978-3-642-38905-4 doi
Computer science.
Data structures (Computer science).
Algorithms.
Numerical analysis.
Computer science--Mathematics.
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