Central Library

Normal view MARC view ISBD view

Combinatorial Pattern Matching [electronic resource] : 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings / edited by Johannes Fischer, Peter Sanders.

Contributor(s): Fischer, Johannes [editor.] | Sanders, Peter [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computer Science: 7922Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2013Description: X, 259 p. 58 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642389054.Subject(s): 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/BioinformaticsAdditional physical formats: Printed edition:: No titleDDC classification: 006.4 Online resources: Click here to access online
Contents:
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.
In: Springer eBooksSummary: 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.
    average rating: 0.0 (0 votes)
No physical items for this record

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.

There are no comments for this item.

Log in to your account to post a comment.