Programme
Welcome Cocktail on June 17 (Monday)
Aperitivo at Il Bistrot starting at 19:00.
Tuesday, June 18, 2019
| Registration | |
| Opening Remarks | |
| Paweł Gawrychowski How to exploit periodicity | |
| Coffee Break | |
| Hideo Bannai, Juha Kärkkäinen, Dominik Köppl and Marcin Piątkowski Indexing the Bijective BWT | |
| Raffaele Giancarlo, Giovanni Manzini, Giovanna Rosone and Marinella Sciortino A New Class of Searchable and Provably Highly Compressible String Transformations | |
| Nicola Prezza and Giovanna Rosone Space-Efficient Computation of the LCP Array from the Burrows-Wheeler Transform | |
| Break | |
| Sung Gwan Park, Amihood Amir, Gad M. Landau and Kunsoo Park Cartesian Tree Matching and Indexing | |
| Djamal Belazzougui and Fabio Cunial Fully-functional bidirectional Burrows-Wheeler indexes | |
| Bastien Cazaux and Eric Rivals Linking BWT and XBW via Aho-Corasick automaton: applications to Run-Length Encoding | |
| Lunch | |
| Diptarka Chakraborty Approximating edit distance within constant factor in truly sub-quadratic time | |
| Diptarama Hendrian, Takuya Takagi and Shunsuke Inenaga Online Algorithms for Constructing Linear-size Suffix Trie | |
| Nicola Prezza Optimal Rank and Select Queries on Dictionary-Compressed Text | |
| Coffee Break | |
| Takaaki Nishimoto and Yasuo Tabei Conversion from RLBWT to LZ77 | |
| Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations | |
| Business Meeting | |
Wednesday, June 19, 2019
| Michal Ziv-Ukelson Stringology combats microbiological threats | |
| Coffee Break | |
| Diego Diaz-Dominguez, Travis Gagie and Gonzalo Navarro Simulating the DNA string graph in succinct space | |
| Niko Kiirala, Leena Salmela and Alexandru I. Tomescu Safe and complete algorithms for dynamic programming problems, with an application to RNA folding | |
| Haitao Jiang, Jiong Guo, Daming Zhu and Binhai Zhu A 2-Approximation Algorithm for the Complementary Maximal Strip Recovery Problem | |
| Break | |
| Jan Studený and Przemysław Uznański Approximating Approximate Pattern Matching | |
| Mai Alzamel, Maxime Crochemore, Costas Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszyński, Tomasz Waleń and Wiktor Zuba Quasi-Linear-Time Algorithm for Longest Common Circular Factor | |
| Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda Faster queries for longest substring palindrome after block edit | |
| Lunch | |
| Nicola Prezza At the roots of dictionary compression: string attractors | |
| Pawel Gawrychowski, Jakub Radoszewski and Tatiana Starikovskaya Quasi-periodicity in streams | |
| Oleg Merkurev and Arseny Shur Searching Long Repeats in Streams | |
| Excursion and Conference Banquet | |
Excursion
Trip to Lucca from 16:00 to 20:00.
Conference Banquet
Dinner for all participants at La clessidra starting at 20:30.
Thursday, June 20, 2019
| Antonio Restivo Some variations on Lyndon words | |
| Coffee Break | |
| Hayam Alamro, Golnaz Badkobeh, Djamal Belazzougui, Costas S. Iliopoulos and Simon J. Puglisi Computing the Antiperiod(s) of a String | |
| Julian Pape-Lange On Maximal Repeats in Compressed Strings | |
| Ali Akhavi, Julien Clément, Dimitri Darthenay, Loïck Lhote and Brigitte Vallee Dichotomic selection on words: a probabilistic analysis | |
| Break | |
| Giulia Bernardini, Paola Bonizzoni, Gianluca Della Vedova and Murray Patterson A rearrangement distance for fully-labelled trees | |
| Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Daniel Paulusma and Stephane Vialette Finding a Small Number of Colourful Components | |
| Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda Computing runs on a trie | |
| Lunch | |
| Karim Labib, Przemysław Uznański and Daniel Wolleb-Graf Hamming distance completeness | |
| Pawel Gawrychowski and Tatiana Starikovskaya Streaming dictionary matching with mismatches | |
| Dmitry Kosolobov and Nikita Sivukhin Compressed Multiple Pattern Matching | |
| Coffee Break | |
| Eitan Kondratovsky and Amihood Amir Sufficient Conditions for Efficient Indexing under Different Matchings | |
| Michał Gańczorz Entropy lower bounds for dictionary compression | |
| Closing Remarks | |