Skip to main content
  • Conference proceedings
  • © 2015

Combinatorial Pattern Matching

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

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)

Conference series link(s): CPM: Annual Symposium on Combinatorial Pattern Matching

Conference proceedings info: CPM 2015.

Buying options

eBook USD 59.99
Price excludes VAT (USA)
  • ISBN: 978-3-319-19929-0
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 79.99
Price excludes VAT (USA)

This is a preview of subscription content, access via your institution.

Table of contents (34 papers)

  1. Front Matter

    Pages I-XIX
  2. A Framework for Space-Efficient String Kernels

    • Djamal Belazzougui, Fabio Cunial
    Pages 13-25
  3. Composite Repetition-Aware Data Structures

    • Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, Mathieu Raffinot
    Pages 26-39
  4. Longest Common Extensions in Trees

    • Philip Bille, Paweł Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann
    Pages 52-64
  5. 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
  6. Ranked Document Retrieval with Forbidden Pattern

    • Sudip Biswas, Arnab Ganguly, Rahul Shah, Sharma V. Thankachan
    Pages 77-88
  7. Parameterized Complexity of Superstring Problems

    • Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh
    Pages 89-99
  8. 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
  9. Fast String Dictionary Lookup with One Error

    • Timothy Chan, Moshe Lewenstein
    Pages 114-123
  10. On the Readability of Overlap Digraphs

    • Rayan Chikhi, Paul Medvedev, Martin Milanič, Sofya Raskhodnikova
    Pages 124-137
  11. Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem

    • Sukhyeun Cho, Joong Chae Na, Jeong Seop Sim
    Pages 138-148
  12. Range Minimum Query Indexes in Higher Dimensions

    • Pooya Davoodi, John Iacono, Gad M. Landau, Moshe Lewenstein
    Pages 149-159
  13. Alphabet-Dependent String Searching with Wexponential Search Trees

    • Johannes Fischer, Paweł Gawrychowski
    Pages 160-171
  14. Lempel Ziv Computation in Small Space (LZ-CISS)

    • Johannes Fischer, Tomohiro I, Dominik Köppl
    Pages 172-184
  15. Succinct Non-overlapping Indexing

    • Arnab Ganguly, Rahul Shah, Sharma V. Thankachan
    Pages 185-195
  16. Encodings of Range Maximum-Sum Segment Queries and Applications

    • Paweł Gawrychowski, Patrick K. Nicholson
    Pages 196-206
  17. Compact Indexes for Flexible Top- \(k\) Retrieval

    • Simon Gog, Matthias Petri
    Pages 207-218
  18. LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding

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

Other Volumes

  1. Combinatorial Pattern Matching

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

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.

Keywords

  • Bioinformatics
  • Coding and data compression
  • Combinatorics on words
  • Computational biology
  • Data compression
  • Data mining
  • Data structure
  • Dictionary matching
  • Dynamic programming
  • Fixed-parameter algorithm
  • Genome rearrangements
  • Graphs
  • Information retrieval
  • Online algorithm
  • Parallel algorithms
  • Pattern matching
  • String algorithms
  • String processing in databases
  • Text searching
  • Trees
  • algorithm analysis and problem complexity

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

Buying options

eBook USD 59.99
Price excludes VAT (USA)
  • ISBN: 978-3-319-19929-0
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 79.99
Price excludes VAT (USA)