Combinatorial Pattern Matching: 23rd Annual Symposium, Cpm 2012, Helsinki, Finland, July 3-5, 2012, Proceedings

Karkkainen, Juha (Editor)/ Stoye, Jens (Editor)

ISBN 10: 3642312640 / ISBN 13: 9783642312649

Verlag: Springer-Verlag New York Inc, 2012

Beschreibung

2012 edition. 467 pages. 8.75x6.00x0.75 inches. In Stock.

Bestandsnummer des Verkäufers x-3642312640

Bibliografische Details

• Titel: Combinatorial Pattern Matching: 23rd Annual Symposium, Cpm 2012, Helsinki, Finland, July 3-5, 2012, Proceedings
• Verlag: Springer-Verlag New York Inc
• Erscheinungsjahr: 2012
• Sprache: Englisch
• ISBN-10: 3642312640
• ISBN-13: 9783642312649
• Einband: Paperback
• Zustand: Brand New
• Gewicht: 0,61 Kilogramm

Über diesen Titel

Inhaltsangabe

This book constitutes the refereed proceedings of the 23rd Annual Symposium on Combinatorial Pattern Matching, C.P.M. 2012, held in Helsinki, Finland, 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.

Von der hinteren Coverseite

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.