Logo - springer
Slogan - springer

Computer Science - Image Processing | Combinatorial Pattern Matching - 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June

Combinatorial Pattern Matching

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

Fischer, Johannes, Sanders, Peter (Eds.)

2013, X, 259 p. 58 illus.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$49.99

(net) price for USA

ISBN 978-3-642-38905-4

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$72.00

(net) price for USA

ISBN 978-3-642-38904-7

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

  • Up-to-date results
  • Fast track conference proceedings
  • State-of-the-art report
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.

Content Level » Research

Keywords » NP-Completeness - bit-parallelism - external memory algorithms - grammar-based compression - text indexes

Related subjects » Bioinformatics - Image Processing - Theoretical Computer Science

Table of contents 

Searching and matching strings and more complicated patterns.-  Trees, regular expressions, graphs, point sets, and arrays.-  Non-trivial combinatorial properties of such structures.- Problems in computational biology.- Data compression and data mining.- Coding.- Information retrieval.- Natural language processing.- Pattern recognition.

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Pattern Recognition.