CPM 2013: Bad Herrenalb, Germany

• Alberto Apostolico, Maxime Crochemore, Martin Farach-Colton, Zvi Galil, S. Muthukrishnan:
  Forty Years of Text Indexing. 1-10
   download paper
• Moshe Lewenstein:
  LCP Magic. 11
   download paper
• Gene Myers:
  Discrete Methods for Image Analysis Applied to Molecular Biology. 12
   download paper

• Mika Amit, Maxime Crochemore, Gad M. Landau:
  Locating All Maximal Approximate Runs in a String. 13-27
   download presentation (PDF)
   download paper
• Maxim A. Babenko, Ignat I. Kolesnichenko, Tatiana A. Starikovskaya:
  On Minimal and Maximal Suffixes of a Substring. 28-37
   download paper
• Hideo Bannai, Pawel Gawrychowski, Shunsuke Inenaga, Masayuki Takeda:
  Converting SLP to LZ78 in almost Linear Time. 38-49
   download presentation (PDF)
   download paper
• Gary Benson, Yozen Hernandez, Joshua Loving:
  A Bit-Parallel, General Integer-Scoring Sequence Alignment Algorithm. 50-61
   download presentation (PDF)
   download paper
• Philip Bille, Patrick Hagge Cording, Inge Li Gortz:
  Compact q-Gram Profiling of Compressed Strings. 62-73
   download presentation (PDF)
   download paper
• Maxime Crochemore, Roberto Grossi, Juha Karkkainen, Gad M. Landau:
  A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler Transform. 74-82
   download presentation (PDF)
   download paper
• Henning Fernau, Markus L. Schmid:
  Pattern Matching with Variables: A Multivariate Complexity Analysis. 83-94
   download presentation (PDF)
   download paper
• Travis Gagie, Wing-Kai Hon, Tsung-Han Ku:
  New Algorithms for Position Heaps. 95-106
   download presentation (PDF)
   download paper
• Travis Gagie, Kalle Karhu, Gonzalo Navarro, Simon J. Puglisi, Jouni Siren:
  Document Listing on Repetitive Collections. 107-119
   download presentation (PDF)
   download paper
• Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin:
  Approximating Shortest Superstring Problem Using de Bruijn Graphs. 120-129
   download paper
• Jiong Guo, Danny Hermelin, Christian Komusiewicz:
  Local Search for String Problems: Brute Force Is Essentially Optimal. 130-141
   download presentation (PDF)
   download paper
• Wing-Kai Hon, Tsung-Han Ku, Rahul Shah, Sharma V. Thankachan:
  Space-Efficient Construction Algorithm for the Circular Suffix Tree. 142-152
   download presentation (PDF)
   download paper
• Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
  Efficient Lyndon Factorization of Grammar Compressed Text. 153-164
   download presentation (PDF)
   download paper
• Artur Jez:
  Approximation of Grammar-Based Compression via Recompression. 165-176
   download presentation (PDF)
   download paper
• Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
  Fast Algorithm for Partial Covers in Words. 177-188
   download presentation (PDF)
   download paper
• Juha Karkkainen, Dominik Kempa, Simon J. Puglisi:
  Linear Time Lempel-Ziv Factorization: Simple, Fast, Small. 189-200
   download presentation (PDF)
   download paper
• Felipe Alves da Louza, Guilherme P. Telles, Cristina Dutra de Aguiar Ciferri:
  External Memory Generalized Suffix and LCP Arrays Construction. 201-210
   download presentation (PDF)
   download paper
• Ury Matarazzo, Dekel Tsur, Michal Ziv-Ukelson:
  Efficient All Path Score Computations on Grid Graphs. 211-222
   download presentation (PDF)
   download paper
• Tatiana A. Starikovskaya, Hjalte Wedel Vildhoj:
  Time-Space Trade-Offs for the Longest Common Substring Problem. 223-234
   download presentation (PDF)
   download paper
• Yasuo Tabei, Yoshimasa Takabatake, Hiroshi Sakamoto:
  A Succinct Grammar Compression. 235-246
   download presentation (PDF)
   download paper
• Elad Verbin, Wei Yu:
  Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings. 247-258
   download paper