Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

DPD courier 4.99 € GLS courier 11.49 €

Contact

How to shop

Help

My account

▸ Empty :-(

Combinatorial Pattern Matching

Name: Combinatorial Pattern Matching
Brand: Springer, Berlin
SKU: 01663866
Price: 47.48 EUR
Availability: InStock
Author: Johannes Fischer
ISBN: 9783642389047

24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013, Proceedings

Johannes Fischer

Peter Sanders

Language

English

Book Paperback

Libristo code: 01663866

Publishers Springer, Berlin, November 2012

This book constitutes the refereed proceedings of the 24th Annual Symposium on Combinatorial Pattern... Full description

Libristo code: 01663866

115 b

47.48 €

In stock at our supplier Shipping in 5-8 days

30-day return policy

Customers also purchased

Abraham Lincoln Theodor Canisius

Paperback

18.48 €

Nickelodeon All-Star Brawl 2 (PlayStation PS4)

Blu-ray

17.67 €

La nuit Jaccaud

Paperback

27.48 €

Kompromisslos verhandeln Chris Voss

Paperback

15.25 €

Manual del perito médico : fundamentos técnicos y jurídicos M. R. Jouvencel

Paperback

28.89 €

Enthospitalisierung und Empowerment - Die Rolle von SA/SP bei der Assistenz von Menschen, die als geistig behindert gelten Jochen Amsink

Paperback

33.94 €

Mensch ohne Schatten Jürgen Kuhl

Paperback

17.57 €

Cestovatel na perutích času Vojtěch Zamarovský Pavel Toufar

Hardback

6.86 €

Matematika 4/2 pro ZŠ pracovní sešit collegium

Paperback

2.82 €

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.