Table of Contents

• Simulating the DNA Overlap Graph in Succinct SpaceDiego Díaz-Domínguez, Travis Gagie, Gonzalo Navarro. [doi]
• Sufficient Conditions for Efficient Indexing Under Different MatchingsAmihood Amir, Eitan Kondratovsky. [doi]
• Quasi-Periodicity in StreamsPawel Gawrychowski, Jakub Radoszewski, Tatiana A. Starikovskaya. [doi]
• Linking BWT and XBW via Aho-Corasick Automaton: Applications to Run-Length EncodingBastien Cazaux, Eric Rivals. [doi]
• Computing Runs on a TrieRyo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. [doi]
• Dichotomic Selection on Words: A Probabilistic AnalysisAli Akhavi, Julien Clément 0001, Dimitri Darthenay, Loïck Lhote, Brigitte Vallée. [doi]
• Hamming Distance CompletenessKarim Labib, Przemyslaw Uznanski, Daniel Wolleb-Graf. [doi]
• Cartesian Tree Matching and IndexingSung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park. [doi]
• Faster Queries for Longest Substring Palindrome After Block EditMitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. [doi]
• Stringology Combats Microbiological Threats (Invited Talk)Michal Ziv-Ukelson. [doi]
• Finding a Small Number of Colourful ComponentsLaurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson 0002, Daniël Paulusma, Stéphane Vialette. [doi]
• Some Variations on Lyndon Words (Invited Talk)Francesco Dolce, Antonio Restivo, Christophe Reutenauer. [doi]
• On the Size of Overlapping Lempel-Ziv and Lyndon FactorizationsYuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. [doi]
• A Rearrangement Distance for Fully-Labelled TreesGiulia Bernardini 0001, Paola Bonizzoni, Gianluca Della Vedova, Murray Patterson. [doi]
• Indexing the Bijective BWTHideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski. [doi]
• Quasi-Linear-Time Algorithm for Longest Common Circular FactorMai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba. [doi]
• On Maximal Repeats in Compressed StringsJulian Pape-Lange. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Entropy Lower Bounds for Dictionary CompressionMichal Ganczorz. [doi]
• Optimal Rank and Select Queries on Dictionary-Compressed TextNicola Prezza. [doi]
• A New Class of Searchable and Provably Highly Compressible String TransformationsRaffaele Giancarlo, Giovanni Manzini, Giovanna Rosone, Marinella Sciortino. [doi]
• Streaming Dictionary Matching with MismatchesPawel Gawrychowski, Tatiana A. Starikovskaya. [doi]
• Approximating Approximate Pattern MatchingJan Studený, Przemyslaw Uznanski. [doi]
• A 2-Approximation Algorithm for the Complementary Maximal Strip Recovery ProblemHaitao Jiang, Jiong Guo, Daming Zhu, Binhai Zhu. [doi]
• Compressed Multiple Pattern MatchingDmitry Kosolobov, Nikita Sivukhin. [doi]
• Conversion from RLBWT to LZ77Takaaki Nishimoto, Yasuo Tabei. [doi]
• Searching Long Repeats in StreamsOleg Merkurev, Arseny M. Shur. [doi]
• Computing the Antiperiod(s) of a StringHayam Alamro, Golnaz Badkobeh, Djamal Belazzougui, Costas S. Iliopoulos, Simon J. Puglisi. [doi]
• Space-Efficient Computation of the LCP Array from the Burrows-Wheeler TransformNicola Prezza, Giovanna Rosone. [doi]
• Safe and Complete Algorithms for Dynamic Programming Problems, with an Application to RNA FoldingNiko Kiirala, Leena Salmela, Alexandru I. Tomescu. [doi]
• Online Algorithms for Constructing Linear-Size Suffix TrieDiptarama Hendrian, Takuya Takagi, Shunsuke Inenaga. [doi]
• Fully-Functional Bidirectional Burrows-Wheeler Indexes and Infinite-Order De Bruijn GraphsDjamal Belazzougui, Fabio Cunial. [doi]
• How to Exploit Periodicity (Invited Talk)Pawel Gawrychowski. [doi]