Programme

Tuesday, October 9th

08:45 Registration
09:00 Invited (SISAP) Humans, Machines, and Work: The Future is Now Moshe Vardi (US)
10:00 Coffee
10:10 SISAP On the Analysis of Compressed Chemical Fingerprints Ricardo C. Sperandio (France), Simon Malinowski (France), Laurent Amsaleg (France) and Romain Tavenard (France)
SISAP Time Series Retrieval using DTW-Preserving Shapelets Fabio Grandi (Italy)
Joint with SISAP Adaptive Computation of the Discrete Frechet Distance Jérémy Barbay (Chile)
Joint with SISAP Computing Burrows-Wheeler Similarity Distributions for String Collections Felipe A. Louza (Brazil), Guilherme P. Telles (Brazil), Simon Gog (US) and Liang Zhao (Brazil)
11:50 Coffee
12:00 Invited Mining the Integrated Connectedness of Biomedical Systems Nataša Pržulj (UK)
13:00 SISAP Closing
13:10 Lunch
14:30 Excursion and Dinner
23:00 Finish

Wednesday, October 10th

09:00 Registration
10:00 Invited Data Compression: The Whole is Larger than the Sum of its Parts Rossano Venturini (Italy)
11:00 Coffee
11:20 Information Retrieval Fast and Effective Neural Networks for Translating Natural Language into Denotations Tiago Pimentel (Brazil), Juliano Viana (Brazil), Adriano Veloso (Brazil) and Nivio Ziviani (Brazil)
11:40 Information Retrieval Early Commenting Features for Emotional Reactions Prediction Anastasia Giachanou (Switzerland), Paolo Rosso (Spain), Ida Mele (Italy) and Fabio Crestani (Switzerland)
12:00 Lunch
14:00 LCS and LCP Compressed Communication Complexity of Longest Common Prefixes Philip Bille (Denmark), Mikko Berggreen Ettienne (Denmark), Roberto Grossi (Italy), Inge Li Gørtz (Denmark) and Eva Rotenberg (Denmark)
14:20 LCS and LCP Better heuristic algorithms for the Repetition Free LCS and other variants PRadu-Stefan Mincu (Romania) and Alexandru Popa (Romania)
14:40 LCS and LCP Longest Property-Preserved Common Factor Lorraine A.K. Ayad (UK), Giulia Bernardini (Italy), Roberto Grossi (Italy), Costas Iliopoulos (UK), Nadia Pisanti (Italy), Solon Pissis (UK) and Giovanna Rosone (Italy)
14:55 LCS and LCP Indexed Dynamic Programming to boost Edit Distance and LCSS Computation Jérémy Barbay (Chile) and Andrés Olivares (Chile)
15:15 LCS and LCP Longest Common Prefixes with k-Errors and Applications Lorraine Ayad (UK), Carl Barton (UK), Panagiotis Charalampopoulos (UK), Costas Iliopoulos (UK) and Solon Pissis (UK)
15:35 Coffee
15:55 (Re)Construction Optimal In-Place Suffix Sorting Zhize Li (China), Jian Li (China) and Hongwei Huo (China)
16:15 (Re)Construction Fast Wavelet Tree Construction in Practice Yusaku Kaneta (Japan)
16:35 (Re)Construction Recovering, counting and enumerating strings from forward and backward suffix arrays Yuki Kuhara (Japan), Yuto Nakashima (Japan), Shunsuke Inenaga (Japan), Hideo Bannai (Japan) and Masayuki Takeda (Japan)
16:55 (Re)Construction Linear-Time Online Algorithm Inferring the Shortest Path from a Walk Shintaro Narisada (Japan), Diptarama Hendrian (Japan), Ryo Yoshinaka (Japan) and Ayumi Shinohara (Japan)
17:15 Finish

Thursday, October 11th

08:30 Registration
09:00 Invited Techniques for Grammar-Based Compression Philip Bille (Denmark)
10:00 Coffee
10:20 Combinatorics on Words On Extended Special Factors of a Word Panagiotis Charalampopoulos (UK), Maxime Crochemore (UK) and Solon P. Pissis (UK)
10:35 Combinatorics on Words Truncated DAWGs and their application to minimal absent word problem Yuta Fujishige (Japan), Takuya Takagi (Japan) and Diptarama Hendrian (Japan)
10:55 Combinatorics on Words Block Palindromes: A New Generalization of Palindromes Keisuke Goto (Japan), Tomohiro I (Japan), Hideo Bannai (Japan) and Shunsuke Inenaga (Japan)
11:10 Pattern Matching Faster Recovery of Approximate Periods over Edit Distance Tomasz Kociumaka (Poland), Jakub Radoszewski (Poland), Wojciech Rytter (Poland), Juliusz Straszyński (Poland), Tomasz Walen (Poland) and Wiktor Zuba (Poland)
11:25 Pattern Matching Searching for a Modified Pattern in a Changing Text Eitan Kondratovsky (Israel) and Amihood Amir (Israel)
11:45 Pattern Matching Trickier XBWT Tricks Enno Ohlebusch (Germany), Stefan Stauß (Germany) and Uwe Baier (Germany)
12:00 Lunch
14:00 Data Structures New structures to solve aggregated queries for trips over public transportation networks Nieves R. Brisaboa (Spain), Antonio Fariña (Spain), Daniil Galaktionov (Spain), Tirso V. Rodeiro (Spain) and Andrea Rodriguez (Chile)
14:20 Data Structures Faster and Smaller Two-Level Index for Network-based Trajectories Rodrigo Rivera (Chile), Andrea Rodríguez (Chile) and Diego Seco (Chile)
14:40 Data Structures Compressed Range Minimum Queries Seungbum Jo (Israel), Shay Mozes (Israel) and Oren Weimann (Israel)
15:00 Data Structures 3DGraCT: A Grammar based Compressed representation of 3D Trajectories Nieves R. Brisaboa (Spain), Adrián Gómez-Brandón (Spain), Miguel A. Martínez-Prieto (Spain) and José R. Paramá (Spain)
15:20 Data Structures Towards a compact representation of temporal rasters Ana Cerdeira-Pena (Spain), Guillermo de Bernardo (Spain), Antonio Fariña (Spain), José Ramón Paramá (Spain) and Fernando Silva-Coira (Spain)
15:40 Coffee
16:00 Bioinformatics Maximal Motif Discovery in a Sliding Window Costas Iliopoulos (UK), Manal Mohamed (UK), Solon Pissis (UK) and Fatima Vayani (UK)
16:20 Bioinformatics Recoloring the Colored de Bruijn Graph Bahar Alipanahi (US), Alan Kuhnle (US) and Christina Boucher (US)
16:35 Bioinformatics Efficient Computation of Sequence Mappability Mai Alzamel (UK), Panagiotis Charalampopoulos (UK), Costas Iliopoulos (UK), Tomasz Kociumaka (Poland), Solon Pissis (Poland), Jakub Radoszewski (Poland) and Juliusz Straszynski (Poland)
16:55 Bioinformatics The colored longest common prefix array computed via sequential scans Fabio Garofalo (Italy), Giovanna Rosone (Italy), Marinella Sciortino (Italy) and Davide Verzotto (Italy)
17:15 Farewell Reception
19:00 Finish