Table of Contents

• Optimal Omnitig Listing for Safe and Complete Contig AssemblyMassimo Cairo, Paul Medvedev, Nidia Obscura Acosta, Romeo Rizzi, Alexandru I. Tomescu. [doi]
• Dynamic Elias-Fano RepresentationGiulio Ermanno Pibiri, Rossano Venturini. [doi]
• Approximate Cover of StringsAmihood Amir, Avivit Levy, Ronit Lubin, Ely Porat. [doi]
• Fast and Simple Jumbled Indexing for Binary Run-Length Encoded StringsLuís Felipe I. Cunha, Simone Dantas, Travis Gagie, Roland Wittler, Luis Antonio Brasil Kowada, Jens Stoye. [doi]
• Deterministic Indexing for Packed StringsPhilip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen. [doi]
• Gapped Pattern StatisticsPhilippe Duchon, Cyril Nicaud, Carine Pivoteau. [doi]
• Path Queries on FunctionsTravis Gagie, Meng He 0001, Gonzalo Navarro. [doi]
• Palindromic Length in Linear TimeKirill Borozdin, Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur. [doi]
• Beyond Adjacency Maximization: Scaffold Filling for New String DistancesLaurent Bulteau, Guillaume Fertin, Christian Komusiewicz. [doi]
• Revisiting the Parameterized Complexity of Maximum-Duo Preservation String MappingChristian Komusiewicz, Mateus de Oliveira Oliveira, Meirav Zehavi. [doi]
• Synergistic Solutions on MultiSetsJérémy Barbay, Carlos Ochoa, Srinivasa Rao Satti. [doi]
• Time-Space Trade-Offs for Lempel-Ziv Compressed IndexingPhilip Bille, Mikko Berggren Ettienne, Inge Li Gørtz, Hjalte Wedel Vildhøj. [doi]
• Recompression of SLPsArtur Jez. [doi]
• Communication and Streaming Complexity of Approximate Pattern MatchingTatiana A. Starikovskaya. [doi]
• Tight Bounds on the Maximum Number of Shortest Unique SubstringsTakuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. [doi]
• From LZ77 to the Run-Length Encoded Burrows-Wheeler Transform, and BackAlberto Policriti, Nicola Prezza. [doi]
• On-Line Pattern Matching on Similar TextsRoberto Grossi, Costas S. Iliopoulos, Chang Liu, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Giovanna Rosone, Fatima Vayani, Luca Versari. [doi]
• Wheeler Graphs: Variations on a Theme by Burrows and WheelerGiovanni Manzini. [doi]
• Computing All Distinct Squares in Linear Time for Integer AlphabetsHideo Bannai, Shunsuke Inenaga, Dominik Köppl. [doi]
• Clique-Based Lower Bounds for Parsing Tree-Adjoining GrammarsKarl Bringmann, Philip Wellnitz. [doi]
• Faster STR-IC-LCS Computation via RLEKeita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. [doi]
• A Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping ProblemBartlomiej Dudek, Pawel Gawrychowski, Piotr Ostropolski-Nalewaja. [doi]
• Document Listing on Repetitive Collections with Guaranteed PerformanceGonzalo Navarro. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers [doi]
• Longest Common Extensions with RecompressionTomohiro I. [doi]
• Can We Recover the Cover?Amihood Amir, Avivit Levy, Moshe Lewenstein, Ronit Lubin, Benny Porat. [doi]
• On the Weighted Quartet Consensus ProblemManuel Lafond, Céline Scornavacca. [doi]
• Representing the Suffix Tree with the CDAWGDjamal Belazzougui, Fabio Cunial. [doi]
• Position Heaps for Parameterized StringsDiptarama, Takashi Katsura, Yuhei Otomo, Kazuyuki Narisawa, Ayumi Shinohara. [doi]
• Lempel-Ziv Compression in a Sliding WindowPhilip Bille, Patrick Hagge Cording, Johannes Fischer 0001, Inge Li Gørtz. [doi]
• The Longest Filled Common Subsequence ProblemMauro Castelli, Riccardo Dondi, Giancarlo Mauri, Italo Zoppis. [doi]
• Shortest SuperstringMarcin Mucha. [doi]