Combinatorial Pattern Matching

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

  • Johannes Fischer
  • Peter Sanders
Conference proceedings CPM 2013

DOI: 10.1007/978-3-642-38905-4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7922)

Table of contents

  1. Front Matter
  2. Alberto Apostolico, Maxime Crochemore, Martin Farach-Colton, Zvi Galil, S. Muthukrishnan
    Pages 1-10
  3. Moshe Lewenstein
    Pages 11-11
  4. Mika Amit, Maxime Crochemore, Gad M. Landau
    Pages 13-27
  5. Maxim Babenko, Ignat Kolesnichenko, Tatiana Starikovskaya
    Pages 28-37
  6. Hideo Bannai, Paweł Gawrychowski, Shunsuke Inenaga, Masayuki Takeda
    Pages 38-49
  7. Gary Benson, Yozen Hernandez, Joshua Loving
    Pages 50-61
  8. Philip Bille, Patrick Hagge Cording, Inge Li Gørtz
    Pages 62-73
  9. Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen, Gad M. Landau
    Pages 74-82
  10. Henning Fernau, Markus L. Schmid
    Pages 83-94
  11. Travis Gagie, Wing-Kai Hon, Tsung-Han Ku
    Pages 95-106
  12. Travis Gagie, Kalle Karhu, Gonzalo Navarro, Simon J. Puglisi, Jouni Sirén
    Pages 107-119
  13. Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin
    Pages 120-129
  14. Jiong Guo, Danny Hermelin, Christian Komusiewicz
    Pages 130-141
  15. Wing-Kai Hon, Tsung-Han Ku, Rahul Shah, Sharma V. Thankachan
    Pages 142-152
  16. Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    Pages 153-164
  17. Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń
    Pages 177-188
  18. Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
    Pages 189-200

About these proceedings

Introduction

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.

Keywords

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

Editors and affiliations

  • Johannes Fischer
    • 1
  • Peter Sanders
    • 2
  1. 1.Fakultät für Informatik, Institut für Theoretische InformatikKarlsruhe Institut für TechnologyKarlsruheGermany
  2. 2.Karlsruhe Institute of TechnologyGermany

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2013
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-38904-7
  • Online ISBN 978-3-642-38905-4
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349