LIPIcs, Volume 78, CPM 2017

• Juha Kärkkäinen, Jakub Radoszewski, and Wojciech Rytter LIPIcs, Volume 78, CPM'17, Complete Volume 10.4230/LIPIcs.CPM.2017
• Juha Kärkkäinen, Jakub Radoszewski, and Wojciech Rytter Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers 10.4230/LIPIcs.CPM.2017.0
• Giovanni Manzini Wheeler Graphs: Variations on a Theme by Burrows and Wheeler 10.4230/LIPIcs.CPM.2017.1
• Artur Jez Recompression of SLPs 10.4230/LIPIcs.CPM.2017.2
• Marcin Mucha Shortest Superstring 10.4230/LIPIcs.CPM.2017.3
• Gonzalo Navarro Document Listing on Repetitive Collections with Guaranteed Performance 10.4230/LIPIcs.CPM.2017.4
• Travis Gagie, Meng He, and Gonzalo Navarro Path Queries on Functions 10.4230/LIPIcs.CPM.2017.5
• Philip Bille, Inge Li Gørtz, and Frederik Rye Skjoldjensen Deterministic Indexing for Packed Strings 10.4230/LIPIcs.CPM.2017.6
• Djamal Belazzougui and Fabio Cunial Representing the Suffix Tree with the CDAWG 10.4230/LIPIcs.CPM.2017.7
• Diptarama Diptarama, Takashi Katsura, Yuhei Otomo, Kazuyuki Narisawa, and Ayumi Shinohara Position Heaps for Parameterized Strings 10.4230/LIPIcs.CPM.2017.8
• Roberto Grossi, Costas S. Iliopoulos, Chang Liu, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Giovanna Rosone, Fatima Vayani, and Luca Versari On-Line Pattern Matching on Similar Texts 10.4230/LIPIcs.CPM.2017.9
• Bartlomiej Dudek, Pawel Gawrychowski, and Piotr Ostropolski-Nalewaja A Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem 10.4230/LIPIcs.CPM.2017.10
• Christian Komusiewicz, Mateus de Oliveira Oliveira, and Meirav Zehavi Revisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping 10.4230/LIPIcs.CPM.2017.11
• Karl Bringmann and Philip Wellnitz Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars 10.4230/LIPIcs.CPM.2017.12
• Tatiana Starikovskaya Communication and Streaming Complexity of Approximate Pattern Matching 10.4230/LIPIcs.CPM.2017.13
• Mauro Castelli, Riccardo Dondi, Giancarlo Mauri, and Italo Zoppis The Longest Filled Common Subsequence Problem 10.4230/LIPIcs.CPM.2017.14
• Philip Bille, Patrick Hagge Cording, Johannes Fischer, and Inge Li Gørtz Lempel-Ziv Compression in a Sliding Window 10.4230/LIPIcs.CPM.2017.15
• Philip Bille, Mikko Berggren Ettienne, Inge Li Gørtz, and Hjalte Wedel Vildhøj Time-Space Trade-Offs for Lempel-Ziv Compressed Indexing 10.4230/LIPIcs.CPM.2017.16
• Alberto Policriti and Nicola Prezza From LZ77 to the Run-Length Encoded Burrows-Wheeler Transform, and Back 10.4230/LIPIcs.CPM.2017.17
• Tomohiro I Longest Common Extensions with Recompression 10.4230/LIPIcs.CPM.2017.18
• Luís Cunha, Simone Dantas, Travis Gagie, Roland Wittler, Luis Kowada, and Jens Stoye Fast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings 10.4230/LIPIcs.CPM.2017.19
• Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda Faster STR-IC-LCS Computation via RLE 10.4230/LIPIcs.CPM.2017.20
• Philippe Duchon, Cyril Nicaud, and Carine Pivoteau Gapped Pattern Statistics 10.4230/LIPIcs.CPM.2017.21
• Hideo Bannai, Shunsuke Inenaga, and Dominik Köppl Computing All Distinct Squares in Linear Time for Integer Alphabets 10.4230/LIPIcs.CPM.2017.22
• Kirill Borozdin, Dmitry Kosolobov, Mikhail Rubinchik, and Arseny M. Shur Palindromic Length in Linear Time 10.4230/LIPIcs.CPM.2017.23
• Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda Tight Bounds on the Maximum Number of Shortest Unique Substrings 10.4230/LIPIcs.CPM.2017.24
• Amihood Amir, Avivit Levy, Moshe Lewenstein, Ronit Lubin, and Benny Porat Can We Recover the Cover? 10.4230/LIPIcs.CPM.2017.25
• Amihood Amir, Avivit Levy, Ronit Lubin, and Ely Porat Approximate Cover of Strings 10.4230/LIPIcs.CPM.2017.26
• Laurent Bulteau, Guillaume Fertin, and Christian Komusiewicz Beyond Adjacency Maximization: Scaffold Filling for New String Distances 10.4230/LIPIcs.CPM.2017.27
• Manuel Lafond and Celine Scornavacca On the Weighted Quartet Consensus Problem 10.4230/LIPIcs.CPM.2017.28
• Massimo Cairo, Paul Medvedev, Nidia Obscura Acosta, Romeo Rizzi, and Alexandru I. Tomescu Optimal Omnitig Listing for Safe and Complete Contig Assembly 10.4230/LIPIcs.CPM.2017.29
• Giulio Ermanno Pibiri and Rossano Venturini Dynamic Elias-Fano Representation 10.4230/LIPIcs.CPM.2017.30
• Jérémy Barbay, Carlos Ochoa, and Srinivasa Rao Satti Synergistic Solutions on MultiSets 10.4230/LIPIcs.CPM.2017.31