CPM 2017

28th Annual Symposium on Combinatorial Pattern Matching

Warsaw, Poland, July 4-6, 2017


Papers and Proceedings

Local information


Accepted papers

Amihood Amir, Avivit Levy, Moshe Lewenstein, Ronit Lubin and Benny Porat. Can We Recover the Cover?
Amihood Amir, Avivit Levy, Ronit Lubin and Ely Porat. Approximate Cover of Strings
Hideo Bannai, Shunsuke Inenaga and Dominik Köppl. Computing All Distinct Squares in Linear Time for Integer Alphabets
Djamal Belazzougui and Fabio Cunial. Representing the suffix tree with the CDAWG
Philip Bille, Patrick Hagge Cording, Johannes Fischer and Inge Li Gørtz. Lempel-Ziv Compression in a Sliding Window
Philip Bille, Mikko Berggren Ettienne, Inge Li Gørtz and Hjalte Wedel Vildhøj. Time-Space Trade-Offs for Lempel-Ziv Compressed Indexing
Philip Bille, Inge Li Gørtz and Frederik Rye Skjoldjensen. Deterministic Indexing for Packed Strings
Karl Bringmann and Philip Wellnitz. Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars
Laurent Bulteau, Guillaume Fertin and Christian Komusiewicz. Beyond Adjacency Maximization: Scaffold Filling for New String Distances
Massimo Cairo, Paul Medvedev, Nidia Obscura Acosta, Romeo Rizzi and Alexandru I. Tomescu. Optimal Omnitig Listing for Safe and Complete Contig Assembly
Mauro Castelli, Riccardo Dondi, Giancarlo Mauri and Italo Zoppis. The Longest Filled Common Subsequence Problem
Luis Cunha, Simone Dantas, Travis Gagie, Roland Wittler, Luis Kowada and Jens Stoye. Faster Jumbled Indexing for Binary RLE Strings
Diptarama, Takashi Katsura, Yuhei Otomo, Kazuyuki Narisawa and Ayumi Shinohara. Position Heaps for Parameterized Strings
Philippe Duchon, Cyril Nicaud and Carine Pivoteau. Gapped Pattern Statistics
Bartlomiej Dudek, Pawel Gawrychowski and Piotr Ostropolski-Nalewaja. A family of approximation algorithms for the maximum duo-preservation string mapping problem
Travis Gagie, Meng He and Gonzalo Navarro. Path Queries on Functions
Roberto Grossi, Costas Iliopoulos, Chang Liu, Nadia Pisanti, Solon Pissis, Ahmad Retha, Giovanna Rosone, Fatima Vayani and Luca Versari. On-line pattern matching on similar texts
Tomohiro I. Longest Common Extensions with Recompression
Christian Komusiewicz, Mateus de Oliveira Oliveira and Meirav Zehavi. Revisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping
Dmitry Kosolobov, Mikhail Rubinchik, Kirill Borozdin and Arseny Shur. Palindromic Length in Linear Time
Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda. Faster STR-IC-LCS computation via RLE
Manuel Lafond and Celine Scornavacca. On the Weighted Quartet Consensus problem
Takuya Mieno, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda. Tight bounds on the maximum number of shortest unique substrings
Gonzalo Navarro. Document Listing on Repetitive Collections with Guaranteed Performance
Carlos Ochoa, Jérémy Barbay and Srinivasa Rao Satti. Synergistic Solutions on MultiSets
Giulio Ermanno Pibiri and Rossano Venturini. Dynamic Elias-Fano Representation
Alberto Policriti and Nicola Prezza. From LZ77 to the Run-Length Encoded Burrows-Wheeler Transform, and Back
Tatiana Starikovskaya. Communication and streaming complexity of approximate pattern matching