Combinatorial Pattern Matching [electronic resource] : 23rd Annual Symposium, CPM 2012, Helsinki, Finland, July 3-5, 2012. Proceedings / edited by Juha Kärkkäinen, Jens Stoye.
By: Kärkkäinen, Juha [editor.].
Contributor(s): Stoye, Jens [editor.] | SpringerLink (Online service).
Material type:
BookSeries: Lecture Notes in Computer Science: 7354Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2012Description: XIII, 454p. 82 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642312656.Subject(s): Computer science | Data structures (Computer science) | Computer software | Electronic data processing | Computational complexity | Optical pattern recognition | Bioinformatics | Computer Science | Pattern Recognition | Algorithm Analysis and Problem Complexity | Numeric Computing | Discrete Mathematics in Computer Science | Data Structures | Computational Biology/BioinformaticsDDC classification: 006.4 Online resources: Click here to access online
In:
Springer eBooksSummary: 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.
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.
There are no comments for this item.