Skip to main content
SpringerLink
Log in

Combinatorial Pattern Matching

26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 -- July 1, 2015, Proceedings

  • Conference proceedings
  • © 2015

Overview

Editors:
  1. Ferdinando Cicalese

    1. Department of Computer Science, University of Verona, Verona, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Ely Porat

    1. Department of Computer Science, Bar-Ilan University, Ramat Gan, Israel

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Ugo Vaccaro

    1. Department of Computer Science, University of Salerno, Fisciano, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

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

Included in the following conference series:

Conference proceedings info: CPM 2015.

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

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and 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

About this book

This book constitutes the refereed proceedings of the 26th Annual Symposium on Combinatorial Pattern Matching, CPM 2015, held on Ischia Island, Italy, in June/July 2015.

The 34 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 83 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 combinatorial properties of such structures and to exploit these properties in order to achieve superior performance for the corresponding computational problems. The meeting also deals with problems in computational biology; data compression and data mining; coding; information retrieval; natural language processing; and pattern recognition.

Similar content being viewed by others

Keywords

Table of contents (34 papers)

  1. Front Matter

    Pages I-XIX
    Download chapter PDF

  2. On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling

    • Amihood Amir, Benny Porat
    Pages 1-12

  3. A Framework for Space-Efficient String Kernels

    • Djamal Belazzougui, Fabio Cunial
    Pages 13-25

  4. Composite Repetition-Aware Data Structures

    • Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, Mathieu Raffinot
    Pages 26-39

  5. Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis

    • Timo Beller, Enno Ohlebusch
    Pages 40-51

  6. Longest Common Extensions in Trees

    • Philip Bille, Paweł Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann
    Pages 52-64

  7. Longest Common Extensions in Sublinear Space

    • Philip Bille, Inge Li Gørtz, Mathias Bæk Tejs Knudsen, Moshe Lewenstein, Hjalte Wedel Vildhøj
    Pages 65-76

  8. Ranked Document Retrieval with Forbidden Pattern

    • Sudip Biswas, Arnab Ganguly, Rahul Shah, Sharma V. Thankachan
    Pages 77-88

  9. Parameterized Complexity of Superstring Problems

    • Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh
    Pages 89-99

  10. On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem

    • Paola Bonizzoni, Riccardo Dondi, Gunnar W. Klau, Yuri Pirola, Nadia Pisanti, Simone Zaccaria
    Pages 100-113

  11. Fast String Dictionary Lookup with One Error

    • Timothy Chan, Moshe Lewenstein
    Pages 114-123

  12. On the Readability of Overlap Digraphs

    • Rayan Chikhi, Paul Medvedev, Martin Milanič, Sofya Raskhodnikova
    Pages 124-137

  13. Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem

    • Sukhyeun Cho, Joong Chae Na, Jeong Seop Sim
    Pages 138-148

  14. Range Minimum Query Indexes in Higher Dimensions

    • Pooya Davoodi, John Iacono, Gad M. Landau, Moshe Lewenstein
    Pages 149-159

  15. Alphabet-Dependent String Searching with Wexponential Search Trees

    • Johannes Fischer, Paweł Gawrychowski
    Pages 160-171

  16. Lempel Ziv Computation in Small Space (LZ-CISS)

    • Johannes Fischer, Tomohiro I, Dominik Köppl
    Pages 172-184

  17. Succinct Non-overlapping Indexing

    • Arnab Ganguly, Rahul Shah, Sharma V. Thankachan
    Pages 185-195

  18. Encodings of Range Maximum-Sum Segment Queries and Applications

    • Paweł Gawrychowski, Patrick K. Nicholson
    Pages 196-206

  19. Compact Indexes for Flexible Top-\(k\) Retrieval

    • Simon Gog, Matthias Petri
    Pages 207-218

  20. LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding

    • Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
    Pages 219-230
Back to top

Other volumes

  1. Combinatorial Pattern Matching

Editors and Affiliations

  • Department of Computer Science, University of Verona, Verona, Italy

    Ferdinando Cicalese

  • Department of Computer Science, Bar-Ilan University, Ramat Gan, Israel

    Ely Porat

  • Department of Computer Science, University of Salerno, Fisciano, Italy

    Ugo Vaccaro

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation