Combinatorial Pattern Matching 22nd Annual Symposium, CPM 2011, Palermo, Italy, June 27-29, 2011, Proceedings /
Combinatorial Pattern Matching 22nd Annual Symposium, CPM 2011, Palermo, Italy, June 27-29, 2011, Proceedings / [electronic resource] :
edited by Raffaele Giancarlo, Giovanni Manzini.
- 1st ed. 2011.
- XV, 480 p. 125 illus., 10 illus. in color. online resource.
- Theoretical Computer Science and General Issues, 6661 2512-2029 ; .
- Theoretical Computer Science and General Issues, 6661 .
This book constitutes the refereed proceedings of the 22nd Annual Symposium on Combinatorial Pattern Matching, CPM 2011, held in Palermi, Italy, in June 2011. The 36 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 70 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.
9783642214585
10.1007/978-3-642-21458-5 doi
Algorithms.
Artificial intelligence--Data processing.
Data mining.
Pattern recognition systems.
Bioinformatics.
Algorithms.
Data Science.
Data Mining and Knowledge Discovery.
Automated Pattern Recognition.
Computational and Systems Biology.
Bioinformatics.
QA76.9.A43
518.1
This book constitutes the refereed proceedings of the 22nd Annual Symposium on Combinatorial Pattern Matching, CPM 2011, held in Palermi, Italy, in June 2011. The 36 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 70 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.
9783642214585
10.1007/978-3-642-21458-5 doi
Algorithms.
Artificial intelligence--Data processing.
Data mining.
Pattern recognition systems.
Bioinformatics.
Algorithms.
Data Science.
Data Mining and Knowledge Discovery.
Automated Pattern Recognition.
Computational and Systems Biology.
Bioinformatics.
QA76.9.A43
518.1