Skip to main content
SpringerLink
Log in
Book cover

Combinatorial Pattern Matching

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

  • Conference proceedings
  • © 2012

Overview

Editors:
  1. Juha Kärkkäinen

    1. Department of Computer Science, University of Helsinki, Helsinki, Finland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Jens Stoye

    1. Faculty of Technology, University of Bielefeld, Bielefeld, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Fast track conference proceedings
  • Unique visibility
  • State of the art research

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: CPM 2012.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (35 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Talks

    1. Gene Regulation, Protein Networks and Disease: A Computational Perspective

      • Ron Shamir
      Pages 1-1

    2. Wavelet Trees for All

      • Gonzalo Navarro
      Pages 2-26

  3. Contributed Papers

    1. The Maximum Number of Squares in a Tree

      • Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter et al.
      Pages 27-40

    2. Faster and Simpler Minimal Conflicting Set Identification

      • Aïda Ouangraoua, Mathieu Raffinot
      Pages 41-55

    3. Partitioning into Colorful Components by Minimum Edge Deletions

      • Sharon Bruckner, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, Sven Thiel, Johannes Uhlmann
      Pages 56-69

    4. Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations

      • Dima Blokh, Danny Segev, Roded Sharan
      Pages 70-82

    5. Constant-Time Word-Size String Matching

      • Dany Breslauer, Leszek Gąsieniec, Roberto Grossi
      Pages 83-96

    6. Pattern Matching in Multiple Streams

      • Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach
      Pages 97-109

    7. An Efficient Linear Pseudo-minimization Algorithm for Aho-Corasick Automata

      • Omar AitMous, Frédérique Bassino, Cyril Nicaud
      Pages 110-123

    8. Efficient Two-Dimensional Pattern Matching with Scaling and Rotation and Higher-Order Interpolation

      • Christian Hundt, Florian Wendland
      Pages 124-137

    9. Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths

      • Guillaume Blin, Laurent Bulteau, Minghui Jiang, Pedro J. Tejada, Stéphane Vialette
      Pages 138-148

    10. Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence

      • Ferdinando Cicalese, Eduardo Laber, Oren Weimann, Raphael Yuster
      Pages 149-158

    11. The Complexity of String Partitioning

      • Anne Condon, Ján Maňuch, Chris Thachuk
      Pages 159-172

    12. Towards an Optimal Space-and-Query-Time Index for Top-k Document Retrieval

      • Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan
      Pages 173-184

    13. Document Listing for Queries with Excluded Pattern

      • Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter
      Pages 185-195

    14. Cross-Document Pattern Matching

      • Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya
      Pages 196-207

    15. FEMTO: Fast Search of Large Sequence Collections

      • Michael P. Ferguson
      Pages 208-219

    16. Speeding Up q-Gram Mining on Grammar-Based Compressed Texts

      • Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
      Pages 220-231

    17. Simple and Efficient LZW-Compressed Multiple Pattern Matching

      • Paweł Gawrychowski
      Pages 232-242
Back to top

Other volumes

  1. Combinatorial Pattern Matching

Keywords

About this book

This book constitutes the refereed proceedings of the 23rd Annual Symposium on Combinatorial Pattern Matching, CPM 2012, held in Helsinki, Finland, 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.

Editors and Affiliations

  • Department of Computer Science, University of Helsinki, Helsinki, Finland

    Juha Kärkkäinen

  • Faculty of Technology, University of Bielefeld, Bielefeld, Germany

    Jens Stoye

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation