Table of Contents

• On Extensions of Maximal Repeats in Compressed StringsJulian Pape-Lange. [doi]
• Finding the Anticover of a StringMai Alzamel, Alessio Conte, Shuhei Denzumi, Roberto Grossi, Costas S. Iliopoulos, Kazuhiro Kurita, Kunihiro Wasa. [doi]
• Time-Space Tradeoffs for Finding a Long Common SubstringStav Ben Nun, Shay Golan 0001, Tomasz Kociumaka, Matan Kraus. [doi]
• Faster Binary Mean Computation Under Dynamic Time WarpingNathan Schaar, Vincent Froese, Rolf Niedermeier. [doi]
• On Indeterminate Strings MatchingPawel Gawrychowski, Samah Ghazawi, Gad M. Landau. [doi]
• Efficient Tree-Structured Categorical RetrievalDjamal Belazzougui, Gregory Kucherov. [doi]
• In-Place Bijective Burrows-Wheeler TransformsDominik Köppl, Daiki Hashimoto, Diptarama Hendrian, Ayumi Shinohara. [doi]
• Text Indexing and Searching in Sublinear TimeJ. Ian Munro, Gonzalo Navarro, Yakov Nekrich. [doi]
• Summarizing Diverging String Sequences, with Applications to Chain-Letter PetitionsPatty Commins, David Liben-Nowell, Tina Liu, Kiran Tomlinson. [doi]
• FM-Index Reveals the Reverse Suffix ArrayArnab Ganguly 0002, Daniel Gibney, Sahar Hooshmand, M. Oguzhan Külekci, Sharma V. Thankachan. [doi]
• Compressed Orthogonal Search on Suffix Arrays with Applications to Range LCPKotaro Matsuda, Kunihiko Sadakane, Tatiana Starikovskaya, Masakazu Tateshita. [doi]
• Dynamic String AlignmentPanagiotis Charalampopoulos, Tomasz Kociumaka, Shay Mozes. [doi]
• Longest Common Subsequence on Weighted SequencesEvangelos Kipouridis, Kostas Tsichlas. [doi]
• Detecting k-(Sub-)Cadences and Equidistant Subsequence OccurrencesMitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Counting Distinct Patterns in Internal Dictionary MatchingPanagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba. [doi]
• Chaining with Overlaps RevisitedVeli Mäkinen, Kristoffer Sahlin. [doi]
• Genomic Problems Involving Copy Number Profiles: Complexity and AlgorithmsManuel Lafond, Binhai Zhu, Peng Zou. [doi]
• Double String Tandem RepeatsAmihood Amir, Ayelet Butman, Gad M. Landau, Shoshana Marcus, Dina Sokol. [doi]
• Unary Words Have the Smallest Levenshtein k-NeighbourhoodsPanagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Tomasz Walen, Wiktor Zuba. [doi]
• Approximating Text-To-Pattern Distance via Dimensionality ReductionPrzemyslaw Uznanski. [doi]
• Approximating Longest Common Substring with k mismatches: Theory and PracticeGarance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya. [doi]
• DAWGs for Parameterized Matching: Online Construction and Related Indexing StructuresKatsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda. [doi]
• k-Approximate Quasiperiodicity under Hamming and Edit DistanceAleksander Kedzierski, Jakub Radoszewski. [doi]
• Algebraic Algorithms for Finding Patterns in Graphs (Invited Talk)Thore Husfeldt. [doi]
• Parameterized Algorithms for Matrix Completion with Radius ConstraintsTomohiro Koana, Vincent Froese, Rolf Niedermeier. [doi]
• On Two Measures of Distance Between Fully-Labelled TreesGiulia Bernardini 0001, Paola Bonizzoni, Pawel Gawrychowski. [doi]
• String Factorizations Under Various Collision ConstraintsNiels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer. [doi]
• The Streaming k-Mismatch Problem: Tradeoffs Between Space and Total TimeShay Golan 0001, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat. [doi]
• String Sanitization Under Edit DistanceGiulia Bernardini 0001, Huiping Chen, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Leen Stougie, Michelle Sweering. [doi]