Combinatorial Pattern Matching [electronic resource] : 22nd Annual Symposium, CPM 2011, Palermo, Italy, June 27-29, 2011. Proceedings / edited by Raffaele Giancarlo, Giovanni Manzini.
By: Giancarlo, Raffaele [editor.].
Contributor(s): Manzini, Giovanni [editor.] | SpringerLink (Online service).
Material type:
BookSeries: Lecture Notes in Computer Science: 6661Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2011Description: XV, 480p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642214585.Subject(s): Computer science | Data structures (Computer science) | Computer software | Data mining | Optical pattern recognition | Bioinformatics | Computer Science | Algorithm Analysis and Problem Complexity | Data Structures | Data Mining and Knowledge Discovery | Pattern Recognition | Computational Biology/Bioinformatics | BioinformaticsDDC classification: 005.1 Online resources: Click here to access online
In:
Springer eBooksSummary: 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.
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.
There are no comments for this item.