Front Matter ....Pages I-XVII
Recoloring the Colored de Bruijn Graph (Bahar Alipanahi, Alan Kuhnle, Christina Boucher)....Pages 1-11
Efficient Computation of Sequence Mappability (Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski et al.)....Pages 12-26
Longest Common Prefixes with k-Errors and Applications (Lorraine A. K. Ayad, Carl Barton, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis)....Pages 27-41
Longest Property-Preserved Common Factor (Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis et al.)....Pages 42-49
Adaptive Computation of the Discrete Fréchet Distance (Jérémy Barbay)....Pages 50-60
Indexed Dynamic Programming to Boost Edit Distance and LCSS Computation (Jérémy Barbay, Andrés Olivares)....Pages 61-73
Compressed Communication Complexity of Longest Common Prefixes (Philip Bille, Mikko Berggreen Ettienne, Roberto Grossi, Inge Li Gørtz, Eva Rotenberg)....Pages 74-87
New Structures to Solve Aggregated Queries for Trips over Public Transportation Networks (Nieves R. Brisaboa, Antonio Fariña, Daniil Galaktionov, Tirso V. Rodeiro, M. Andrea Rodríguez)....Pages 88-101
3DGraCT: A Grammar-Based Compressed Representation of 3D Trajectories (Nieves R. Brisaboa, Adrián Gómez-Brandón, Miguel A. Martínez-Prieto, José Ramón Paramá)....Pages 102-116
Towards a Compact Representation of Temporal Rasters (Ana Cerdeira-Pena, Guillermo de Bernardo, Antonio Fariña, José Ramón Paramá, Fernando Silva-Coira)....Pages 117-130
On Extended Special Factors of a Word (Panagiotis Charalampopoulos, Maxime Crochemore, Solon P. Pissis)....Pages 131-138
Truncated DAWGs and Their Application to Minimal Absent Word Problem (Yuta Fujishige, Takuya Takagi, Diptarama Hendrian)....Pages 139-152
The Colored Longest Common Prefix Array Computed via Sequential Scans (Fabio Garofalo, Giovanna Rosone, Marinella Sciortino, Davide Verzotto)....Pages 153-167
Early Commenting Features for Emotional Reactions Prediction (Anastasia Giachanou, Paolo Rosso, Ida Mele, Fabio Crestani)....Pages 168-182
Block Palindromes: A New Generalization of Palindromes (Keisuke Goto, I Tomohiro, Hideo Bannai, Shunsuke Inenaga)....Pages 183-190
Maximal Motif Discovery in a Sliding Window (Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Fatima Vayani)....Pages 191-205
Compressed Range Minimum Queries (Seungbum Jo, Shay Mozes, Oren Weimann)....Pages 206-217
Fast Wavelet Tree Construction in Practice (Yusaku Kaneta)....Pages 218-232
Faster Recovery of Approximate Periods over Edit Distance (Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszyński, Tomasz Waleń, Wiktor Zuba)....Pages 233-240
Searching for a Modified Pattern in a Changing Text (Amihood Amir, Eitan Kondratovsky)....Pages 241-253
Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays (Yuki Kuhara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda)....Pages 254-267
Optimal In-Place Suffix Sorting (Zhize Li, Jian Li, Hongwei Huo)....Pages 268-284
Computing Burrows-Wheeler Similarity Distributions for String Collections (Felipe A. Louza, Guilherme P. Telles, Simon Gog, Liang Zhao)....Pages 285-296
Better Heuristic Algorithms for the Repetition Free LCS and Other Variants (Radu Stefan Mincu, Alexandru Popa)....Pages 297-310
Linear-Time Online Algorithm Inferring the Shortest Path from a Walk (Shintaro Narisada, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara)....Pages 311-324
Trickier XBWT Tricks (Enno Ohlebusch, Stefan Stauß, Uwe Baier)....Pages 325-333
Fast and Effective Neural Networks for Translating Natural Language into Denotations (Tiago Pimentel, Juliano Viana, Adriano Veloso, Nivio Ziviani)....Pages 334-347
Faster and Smaller Two-Level Index for Network-Based Trajectories (Rodrigo Rivera, M. Andrea Rodríguez, Diego Seco)....Pages 348-362
Back Matter ....Pages 363-364