CPM 2015: Ischia Island, Italy

• Amihood Amir, Benny Porat:
  On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling. 1-12
   download presentation (PPTX)
   download paper
• Djamal Belazzougui, Fabio Cunial:
  A Framework for Space-Efficient String Kernels. 13-25
   download presentation (PDF)
   download paper
• Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, Mathieu Raffinot:
  Composite Repetition-Aware Data Structures. 26-39
   download presentation (PDF)
   download paper
• Timo Beller, Enno Ohlebusch:
  Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis. 40-51
   download presentation (PDF)
   download paper
• Philip Bille, Pawel Gawrychowski, Inge Li Gortz, Gad M. Landau, Oren Weimann:
  Longest Common Extensions in Trees. 52-64
   download presentation (PDF)
   download paper
• Philip Bille, Inge Li Gortz, Mathias Baek Tejs Knudsen, Moshe Lewenstein, Hjalte Wedel Vildhoj:
  Longest Common Extensions in Sublinear Space. 65-76
   download paper
• Sudip Biswas, Arnab Ganguly, Rahul Shah, Sharma V. Thankachan:
  Ranked Document Retrieval with Forbidden Pattern. 77-88
   download paper
• Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh:
  Parameterized Complexity of Superstring Problems. 89-99
   download presentation (PDF)
   download paper
• Paola Bonizzoni, Riccardo Dondi, Gunnar W. Klau, Yuri Pirola, Nadia Pisanti, Simone Zaccaria:
  On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem. 100-113
   download presentation (PDF)
   download paper
• Timothy M. Chan, Moshe Lewenstein:
  Fast String Dictionary Lookup with One Error. 114-123
   download paper
• Rayan Chikhi, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova:
  On the Readability of Overlap Digraphs. 124-137
   download presentation (PPTX)
   download paper
• Sukhyeun Cho, Joong Chae Na, Jeong Seop Sim:
  Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem. 138-148
   download presentation (PDF)
   download paper
• Pooya Davoodi, John Iacono, Gad M. Landau, Moshe Lewenstein:
  Range Minimum Query Indexes in Higher Dimensions. 149-159
   download paper
• Johannes Fischer, Pawel Gawrychowski:
  Alphabet-Dependent String Searching with Wexponential Search Trees. 160-171
   download presentation (PDF)
   download paper
• Johannes Fischer, Tomohiro I, Dominik Koppl:
  Lempel Ziv Computation in Small Space (LZ-CISS). 172-184
   download presentation (PDF)
   download paper
• Arnab Ganguly, Rahul Shah, Sharma V. Thankachan:
  Succinct Non-overlapping Indexing. 185-195
   download paper
• Pawel Gawrychowski, Patrick K. Nicholson:
  Encodings of Range Maximum-Sum Segment Queries and Applications. 196-206
   download presentation (PPTX)
   download paper
• Simon Gog, Matthias Petri:
  Compact Indexes for Flexible Top-k Retrieval. 207-218
   download presentation (PDF)
   download paper
• Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
  LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding. 219-230
   download presentation (PPTX)
   download paper
• Jozef Hales, Jan Manuch, Yann Ponty, Ladislav Stacho:
  Combinatorial RNA Design: Designability and Structure-Approximating Algorithm. 231-246
   download presentation (PDF)
   download paper
• Wing-Kai Hon, Tak Wah Lam, Rahul Shah, Sharma V. Thankachan, Hing-Fung Ting, Yilin Yang:
  Dictionary Matching with Uneven Gaps. 247-260
   download presentation (PDF)
   download paper
• Gabriel Istrate, Cosmin Bonchis:
  Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley's Process. 261-271
   download presentation (PDF)
   download paper
• Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell:
  The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets. 272-283
   download presentation (PDF)
   download paper
• Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
  String Powers in Trees. 284-294
   download presentation (PDF)
   download paper
• Dmitry Kosolobov:
  Online Detection of Repetitions with Backtracking. 295-306
   download presentation (PDF)
   download paper
• Alexander S. Kulikov, Sergey Savinov, Evgeniy Sluzhaev:
  Greedy Conjecture for Strings of Length 4. 307-315
   download presentation (PDF)
   download paper
• Juha Karkkainen, Dominik Kempa, Marcin Piatkowski:
  Tighter Bounds for the Sum of Irreducible LCP Values. 316-328
   download presentation (PDF)
   download paper
• Juha Karkkainen, Dominik Kempa, Simon J. Puglisi:
  Parallel External Memory Suffix Sorting. 329-342
   download presentation (PDF)
   download paper
• Alexander Loptev, Gregory Kucherov, Tatiana A. Starikovskaya:
  On Maximal Unbordered Factors. 343-354
   download presentation (PDF)
   download paper
• Yoshiaki Matsuoka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
  Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree. 355-366
   download presentation (PPTX)
   download paper
• Gonzalo Navarro, Sharma V. Thankachan:
  Reporting Consecutive Substring Occurrences Under Bounded Gap Constraints. 367-373
   download presentation (PDF)
   download paper
• Cyril Nicaud:
  A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS-Algorithm. 374-384
   download presentation (PDF)
   download paper
• Patrick K. Nicholson, Rajeev Raman:
  Encoding Nearest Larger Values. 385-395
   download presentation (PPTX)
   download paper
• Ron Zeira, Ron Shamir:
  Sorting by Cuts, Joins and Whole Chromosome Duplications. 396-409
   download presentation (PPTX)
   download paper