Theoretical Computer Science and General Issues

Combinatorial Pattern Matching

18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007, Proceedings

Editors: Ma, Bin, Zhang, Kaizhong (Eds.)

Free Preview
  • Presents the proceedings from the 18th Annual Symposium on Combinatorial Pattern Matching
  • Provides new insights in the most recent advances in combinatorial pattern matching
  • Covers algorithmic techniques, approximate pattern matching, data compression, computational biology, pattern analysis, suffix arrays and trees, and algorithmic techniques
see more benefits

Buy this book

eBook $69.99
price for USA in USD (gross)
  • ISBN 978-3-540-73437-6
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $89.99
price for USA in USD
  • ISBN 978-3-540-73436-9
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

The papers contained in this volume were presented at the 18th Annual S- posium on Combinatorial Pattern Matching (CPM 2007) held at the University of Western Ontario, in London, Ontario, Canada from July 9 to 11, 2007. All the papers presented at the conference are original research contri- tions on computational pattern matching and analysis, data compression and compressed text processing, su?x arrays and trees, and computational biology. They were selected from 64 submissions. Each submission was reviewed by at least three reviewers. The committee decided to accept 32 papers. The p- gramme also included three invited talks by Tao Jiang from the University of California, Riverside, USA, S. Muthukrishnan from Rutgers University, USA, and Frances Yao from City University of Hong Kong, Hong Kong. Combinatorial Pattern Matching addresses issues of searching and matching stringsandmorecomplicatedpatternssuchastrees,regularexpressions,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 e?ciently.

Table of contents (35 chapters)

Table of contents (35 chapters)

Buy this book

eBook $69.99
price for USA in USD (gross)
  • ISBN 978-3-540-73437-6
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $89.99
price for USA in USD
  • ISBN 978-3-540-73436-9
  • 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
18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007, Proceedings
Editors
  • Bin Ma
  • Kaizhong Zhang
Series Title
Theoretical Computer Science and General Issues
Series Volume
4580
Copyright
2007
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-540-73437-6
DOI
10.1007/978-3-540-73437-6
Softcover ISBN
978-3-540-73436-9
Edition Number
1
Number of Pages
XII, 368
Topics