Combinatorial Pattern Matching

23rd Annual Symposium, CPM 2012, Helsinki, Finland, July 3-5, 2012. Proceedings

  • Juha Kärkkäinen
  • Jens Stoye

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

Table of contents

  1. Front Matter
  2. Invited Talks

  3. Contributed Papers

    1. Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter et al.
      Pages 27-40
    2. Aïda Ouangraoua, Mathieu Raffinot
      Pages 41-55
    3. Sharon Bruckner, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, Sven Thiel, Johannes Uhlmann
      Pages 56-69
    4. Dany Breslauer, Leszek Gąsieniec, Roberto Grossi
      Pages 83-96
    5. Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach
      Pages 97-109
    6. Omar AitMous, Frédérique Bassino, Cyril Nicaud
      Pages 110-123
    7. Guillaume Blin, Laurent Bulteau, Minghui Jiang, Pedro J. Tejada, Stéphane Vialette
      Pages 138-148
    8. Ferdinando Cicalese, Eduardo Laber, Oren Weimann, Raphael Yuster
      Pages 149-158
    9. Anne Condon, Ján Maňuch, Chris Thachuk
      Pages 159-172
    10. Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan
      Pages 173-184
    11. Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter
      Pages 185-195
    12. Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya
      Pages 196-207
    13. Michael P. Ferguson
      Pages 208-219
    14. Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
      Pages 220-231

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 23rd Annual Symposium on Combinatorial Pattern Matching, CPM 2012, held in Helsinki, Finalnd, in July 2012.
The 33 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 60 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 problems 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

computational complexity data structures multiple pattern matching performance string algorithms

Editors and affiliations

  • Juha Kärkkäinen
    • 1
  • Jens Stoye
    • 2
  1. 1.Department of Computer ScienceUniversity of HelsinkiHelsinkiFinland
  2. 2.Faculty of TechnologyUniversity of BielefeldBielefeldGermany

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-31265-6
  • Copyright Information Springer-Verlag Berlin Heidelberg 2012
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-31264-9
  • Online ISBN 978-3-642-31265-6
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book