Combinatorial Pattern Matching 22nd Annual Symposium, CPM 2011, Palermo, Italy, June 27-29, 2011, Proceedings

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 addre...

Full description

Bibliographic Details
Other Authors: Giancarlo, Raffaele (Editor), Manzini, Giovanni (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2011, 2011
Edition:1st ed. 2011
Series:Theoretical Computer Science and General Issues
Subjects:
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
LEADER 02280nmm a2200361 u 4500
001 EB000386983
003 EBX01000000000000000240035
005 00000000000000.0
007 cr|||||||||||||||||||||
008 130626 ||| eng
020 |a 9783642214585 
100 1 |a Giancarlo, Raffaele  |e [editor] 
245 0 0 |a Combinatorial Pattern Matching  |h Elektronische Ressource  |b 22nd Annual Symposium, CPM 2011, Palermo, Italy, June 27-29, 2011, Proceedings  |c edited by Raffaele Giancarlo, Giovanni Manzini 
250 |a 1st ed. 2011 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 2011, 2011 
300 |a XV, 480 p. 125 illus., 10 illus. in color  |b online resource 
653 |a Bioinformatics 
653 |a Computational and Systems Biology 
653 |a Algorithms 
653 |a Data mining 
653 |a Data Mining and Knowledge Discovery 
653 |a Artificial intelligence—Data processing 
653 |a Automated Pattern Recognition 
653 |a Pattern recognition systems 
653 |a Data Science 
700 1 |a Manzini, Giovanni  |e [editor] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b Springer  |a Springer eBooks 2005- 
490 0 |a Theoretical Computer Science and General Issues 
028 5 0 |a 10.1007/978-3-642-21458-5 
856 4 0 |u https://doi.org/10.1007/978-3-642-21458-5?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 518.1 
520 |a 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