CPM 2013

24th Annual Symposium on Combinatorial Pattern Matching

Bad Herrenalb, Germany, June 17–19, 2013

Conference

Proceedings

Local information

Travel

Other

Accepted Papers for CPM 2013

Wing-Kai Hon, Tsung-Han Ku, Rahul Shah and Sharma V. Thankachan. Space-Efficient Construction Algorithm for the Circular Suffix Tree
Travis Gagie, Wing-Kai Hon and Tsung-Han Ku. New Algorithms for Position Heaps
Artur Jeż. Approximation of grammar-based compression via recompression
Philip Bille, Patrick Hagge Cording and Inge Li Gørtz. Compact q-gram Profiling of Compressed Strings
Henning Fernau and Markus L. Schmid. Pattern Matching with Variables: A Multivariate Complexity Analysis
Tomasz Kociumaka, Solon Pissis, Jakub Radoszewski, Wojciech Rytter and Tomasz Waleń. Fast Algorithm for Partial Covers in Words
Ury Matarazzo, Dekel Tsur and Michal Ziv-Ukelson. Efficient All Path Score Computations on Grid Graphs
Felipe A. Louza, Guilherme P. Telles and Cristina Dutra De Aguiar Ciferri. External Memory Generalized Suffix and LCP Arrays Construction
Mika Amit, Gad M. Landau and Maxime Crochemore. Locating All Maximal Approximate Runs in a String
Alexander Golovnev, Alexander Kulikov and Ivan Mihajlin. Approximating Shortest Superstring Problem Using De Bruijn Graphs
Travis Gagie, Kalle Karhu, Gonzalo Navarro, Jouni Siren and Simon Puglisi. Document Listing on Repetitive Collections
Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen and Gad Landau. A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler Transform
Hideo Bannai, Pawel Gawrychowski, Shunsuke Inenaga and Masayuki Takeda. Converting SLP to LZ78 in almost linear time
Yasuo Tabei, Yoshimasa Takabatake and Hiroshi Sakamoto. A Succinct Grammar Compression
Juha Kärkkäinen, Dominik Kempa and Simon Puglisi. Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
Jiong Guo, Danny Hermelin and Christian Komusiewicz. Local Search for String Problems: Brute Force is Essentially Optimal
Tatiana Starikovskaya and Hjalte Wedel Vildhøj. Time-Space Trade-Offs for the Longest Common Substring Problem
Gary Benson, Yozen Hernandez and Joshua Loving. A Bit-Parallel, General Integer-Scoring Sequence Alignment Algorithm
Elad Verbin and Wei Yu. Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings
Maxim Babenko, Tatiana Starikovskaya and Ignat Kolesnichenko. On Minimal and Maximal Suffixes of a Substring
Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda. Efficient Lyndon factorization of grammar compressed text