Abstract is missing.
- Recoloring the Colored de Bruijn GraphBahar Alipanahi, Alan Kuhnle, Christina Boucher. 1-11 [doi]
- Efficient Computation of Sequence MappabilityMai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski. 12-26 [doi]
- Longest Common Prefixes with k-Errors and ApplicationsLorraine A. K. Ayad, Carl Barton, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis. 27-41 [doi]
- Longest Property-Preserved Common FactorLorraine A. K. Ayad, Giulia Bernardini 0001, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone. 42-49 [doi]
- Adaptive Computation of the Discrete Fréchet DistanceJérémy Barbay. 50-60 [doi]
- Indexed Dynamic Programming to Boost Edit Distance and LCSS ComputationJérémy Barbay, Andrés Olivares. 61-73 [doi]
- Compressed Communication Complexity of Longest Common PrefixesPhilip Bille, Mikko Berggren Ettienne, Roberto Grossi, Inge Li Gørtz, Eva Rotenberg. 74-87 [doi]
- New Structures to Solve Aggregated Queries for Trips over Public Transportation NetworksNieves R. Brisaboa, Antonio Fariña, Daniil Galaktionov, Tirso V. Rodeiro, M. Andrea Rodríguez. 88-101 [doi]
- 3DGraCT: A Grammar-Based Compressed Representation of 3D TrajectoriesNieves R. Brisaboa, Adrián Gómez-Brandón, Miguel A. Martínez-Prieto, José R. Paramá. 102-116 [doi]
- Towards a Compact Representation of Temporal RastersAna Cerdeira-Pena, Guillermo de Bernardo, Antonio Fariña, José R. Paramá, Fernando Silva-Coira. 117-130 [doi]
- On Extended Special Factors of a WordPanagiotis Charalampopoulos, Maxime Crochemore, Solon P. Pissis. 131-138 [doi]
- Truncated DAWGs and Their Application to Minimal Absent Word ProblemYuta Fujishige, Takuya Takagi, Diptarama Hendrian. 139-152 [doi]
- The Colored Longest Common Prefix Array Computed via Sequential ScansFabio Garofalo, Giovanna Rosone, Marinella Sciortino, Davide Verzotto. 153-167 [doi]
- Early Commenting Features for Emotional Reactions PredictionAnastasia Giachanou, Paolo Rosso, Ida Mele, Fabio Crestani. 168-182 [doi]
- Block Palindromes: A New Generalization of PalindromesKeisuke Goto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga. 183-190 [doi]
- Maximal Motif Discovery in a Sliding WindowCostas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Fatima Vayani. 191-205 [doi]
- Compressed Range Minimum QueriesSeungbum Jo, Shay Mozes, Oren Weimann. 206-217 [doi]
- Fast Wavelet Tree Construction in PracticeYusaku Kaneta. 218-232 [doi]
- Faster Recovery of Approximate Periods over Edit DistanceTomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba. 233-240 [doi]
- Searching for a Modified Pattern in a Changing TextAmihood Amir, Eitan Kondratovsky. 241-253 [doi]
- Recovering, Counting and Enumerating Strings from Forward and Backward Suffix ArraysYuki Kuhara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. 254-267 [doi]
- Optimal In-Place Suffix SortingZhize Li, Jian Li, Hongwei Huo. 268-284 [doi]
- Computing Burrows-Wheeler Similarity Distributions for String CollectionsFelipe Alves Louza, Guilherme P. Telles, Simon Gog, Liang Zhao. 285-296 [doi]
- Better Heuristic Algorithms for the Repetition Free LCS and Other VariantsRadu Stefan Mincu, Alexandru Popa 0001. 297-310 [doi]
- Linear-Time Online Algorithm Inferring the Shortest Path from a WalkShintaro Narisada, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara. 311-324 [doi]
- Trickier XBWT TricksEnno Ohlebusch, Stefan Stauß, Uwe Baier. 325-333 [doi]
- Fast and Effective Neural Networks for Translating Natural Language into DenotationsTiago Pimentel, Juliano Viana, Adriano Veloso, Nivio Ziviani. 334-347 [doi]
- Faster and Smaller Two-Level Index for Network-Based TrajectoriesRodrigo Rivera, M. Andrea Rodríguez, Diego Seco. 348-362 [doi]