Theoretical Computer Science and General Issues

Combinatorial Pattern Matching

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

Editors: Fischer, Johannes, Sanders, Peter (Eds.)

  • Up-to-date results
  • Fast track conference proceedings
  • State-of-the-art report
see more benefits

Buy this book

eBook $54.99
price for USA (gross)
  • ISBN 978-3-642-38905-4
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $72.00
price for USA
  • ISBN 978-3-642-38904-7
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

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.

Table of contents (24 chapters)

  • Forty Years of Text Indexing

    Apostolico, Alberto (et al.)

    Pages 1-10

  • LCP Magic

    Lewenstein, Moshe

    Pages 11-11

  • Discrete Methods for Image Analysis Applied to Molecular Biology

    Myers, Gene

    Pages 12-12

  • Locating All Maximal Approximate Runs in a String

    Amit, Mika (et al.)

    Pages 13-27

  • On Minimal and Maximal Suffixes of a Substring

    Babenko, Maxim (et al.)

    Pages 28-37

Buy this book

eBook $54.99
price for USA (gross)
  • ISBN 978-3-642-38905-4
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $72.00
price for USA
  • ISBN 978-3-642-38904-7
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Combinatorial Pattern Matching
Book Subtitle
24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013, Proceedings
Editors
  • Johannes Fischer
  • Peter Sanders
Series Title
Theoretical Computer Science and General Issues
Series Volume
7922
Copyright
2013
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-642-38905-4
DOI
10.1007/978-3-642-38905-4
Softcover ISBN
978-3-642-38904-7
Edition Number
1
Number of Pages
X, 259
Number of Illustrations and Tables
58 b/w illustrations
Topics