Combinatorial Pattern Matching | 19th Annual Symposium, CPM 2008 Pisa, Italy, June 18-20, 2008, Proceedings

Paolo Ferragina (u. a.)

ISBN 10: 3540690662 / ISBN 13: 9783540690665

Published by Springer, 2008

About this Item

Combinatorial Pattern Matching | 19th Annual Symposium, CPM 2008 Pisa, Italy, June 18-20, 2008, Proceedings | Paolo Ferragina (u. a.) | Taschenbuch | xiii | Englisch | 2008 | Springer | EAN 9783540690665 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Seller Inventory # 101803273

Bibliographic Details

• Title: Combinatorial Pattern Matching | 19th Annual Symposium, CPM 2008 Pisa, Italy, June 18-20, 2008, Proceedings
• Publisher: Springer
• Publication Date: 2008
• Language: English
• ISBN 10: 3540690662
• ISBN 13: 9783540690665
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 19D millimeters 235 millimeters width by 155 millimeters height by 19 millimeters depth
• Weight: 517 grams
• Seller catalogs:
  • Bücher

About this title

Synopsis

The papers contained in this volume were presented at the 19th Annual S- posium on Combinatorial Pattern Matching (CPM 2008) held at the University of Pisa, Italy, June 18–20, 2008. All the papers presented at the conference are originalresearchcontributions on computational pattern matching and analysis. They were selected from 78 submissions. Each submission was reviewed by at least three reviewers. The committee decided to accept 25 papers. The programme also includes three invited talks by Daniel M. Gus?eld from the University of California, Davis, USA, J. Ian Munro from the University of Waterloo, Canada, and Prabhakar Raghavan from Yahoo! Research, USA. The objective of the annual CPM meetings is to provide an international forum for research in combinatorial pattern matching and related applications. It addresses issues of searching and matching strings and more complicated p- terns such as trees, regular expressions, graphs, point sets, and arrays. The goal is to derive non-trivialcombinatorialproperties of suchstructures and to exploit these properties in order to either achieve superior performance for the cor- sponding computational problems or pinpoint conditions under which searches cannotbeperformede?ciently. Themeeting also dealswith problems incom- tational biology, data compression, data mining, coding, information retrieval, natural language processing and pattern recognition.

From the Back Cover

This book constitutes the refereed proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM 2008, held in Pisa, Italy, in June 2008.

The 25 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 78 submissions. The papers address all areas related to combinatorial pattern matching and its applications, such as coding and data compression, computational biology, data mining, information retrieval, natural language processing, pattern recognition, string algorithms, string processing in databases, symbolic computing and text searching.