Condition: New.
Paperback or Softback. Condition: New. Combinatorial Pattern Matching: 23rd Annual Symposium, CPM 2012, Helsinki, Finland, July 3-5, 2012, Proceedings. Book.
Condition: New.
Condition: As New. Unread book in perfect condition.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
£ 50.80
Quantity: Over 20 available
Add to basketCondition: New. In.
Seller: Chiron Media, Wallingford, United Kingdom
PF. Condition: New.
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New.
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: As New. Unread book in perfect condition.
Language: English
Published by Springer-Verlag New York Inc, 2012
ISBN 10: 3642312640 ISBN 13: 9783642312649
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. 2012 edition. 467 pages. 8.75x6.00x0.75 inches. In Stock.
Language: English
Published by Springer Berlin Heidelberg, 2012
ISBN 10: 3642312640 ISBN 13: 9783642312649
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the refereed proceedings of the 23rd Annual Symposium on Combinatorial Pattern Matching, CPM 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.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.