Combinatorial Pattern Matching : 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings

Alexander S. Kulikov

ISBN 10: 3319075659 / ISBN 13: 9783319075655

Published by Springer International Publishing, Springer International Publishing, 2014

About this Item

Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the refereed proceedings of the 25th Annual Symposium on Combinatorial Pattern Matching, CPM 2014, held in Moscow, Russia, in June 2014. The 28 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 54 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 combinatorial properties of such structures and to exploit these properties in order to achieve superior performance for the corresponding computational problems. The meeting also deals with problems in computational biology; data compression and data mining; coding; information retrieval; natural language processing; and pattern recognition.

Seller Inventory # 9783319075655

Bibliographic Details

• Title: Combinatorial Pattern Matching : 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings
• Publisher: Springer International Publishing, Springer International Publishing
• Publication Date: 2014
• Language: English
• ISBN 10: 3319075659
• ISBN 13: 9783319075655
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 17D millimeters 235 millimeters width by 155 millimeters height by 17 millimeters depth
• Weight: 470 grams

About this title

Synopsis

This book constitutes the refereed proceedings of the 25th Annual Symposium on Combinatorial Pattern Matching, CPM 2014, held in Moscow, Russia, in June 2014. The 28 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 54 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 combinatorial properties of such structures and to exploit these properties in order to achieve superior performance for the corresponding computational problems. The meeting also deals with problems in computational biology; data compression and data mining; coding; information retrieval; natural language processing; and pattern recognition.