Conference Programme
A. Overview
| June 17 (Monday) | June 18 (Tuesday) | June 19 (Wednesday) | |
|---|---|---|---|
| 09:00-10:00 | Gene Myers: Invited Talk I |
Special Session on the 40th Anniversary of the Suffix Tree |
Moshe Lewenstein: Invited Talk II |
| 10:00-10:25 | Coffee Break | Coffee Break | |
| 10:25-10:50 | Text Compression | Algorithms on Compressed Texts | |
| 10:50-11:15 | |||
| 11:15-11:40 | |||
| 11:40-12:05 | |||
| 12:05-13:15 | Lunch break | ||
| 13:15-13:40 | String Combinatorics I | Text Indexing | Inexact Matching |
| 13:40-14:05 | |||
| 14:05-14:30 | |||
| 14:30-14:55 | Coffee Break | Coffee Break (conference ends) |
|
| 14:55-15:20 | String Combinatorics II | 15:10: departure to Baden-Baden |
|
| 15:20-15:45 | |||
| 15:45-16:10 | |||
| 16:30-19:00 | Group Hike | ||
| 19:00 | Barbecue Dinner | ||
B. Detailed Technical Programme
June 17 (Monday)
- Invited Talk I:
- 09:00-10:00: Gene Myers: Discrete Methods for Image Analysis Applied to Molecular Biology
- Text Compression (chair: Alberto Apostolico):
- 10:25-10:50: Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen, and Gad M. Landau: A Constant-Space Comparison-Based Algorithm for Computing the Burrows–Wheeler Transform
- 10:50-11:15: Juha Kärkkäinen, Dominik Kempa, and Simon J. Puglisi: Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
- 11:15-11:40: Hideo Bannai, Pawel Gawrychowski, Shunsuke Inenaga, and Masayuki Takeda: Converting SLP to LZ78 in almost Linear Time
- 11:40-12:05: Artur Jez: Approximation of Grammar-Based Compression via Recompression
- String Combinatorics I (chair: Inge Li Gørtz):
- 13:15-13:40: Maxim Babenko, Ignat Kolesnichenko, and Tatiana Starikovskaya: On Minimal and Maximal Suffixes of a Substring
- 13:40-14:05: Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, and Tomasz Walen: Fast Algorithm for Partial Covers in Words
- 14:05-14:30: Mika Amit, Maxime Crochemore, and Gad M. Landau: Locating All Maximal Approximate Runs in a String
- String Combinatorics II (chair: Maxime Crochemore):
- 14:55-15:20: Tatiana Starikovskaya and Hjalte Wedel Vildhøj: Time-Space Trade-Offs for the Longest Common Substring Problem
- 15:20-15:45: Alexander Golovnev, Alexander S. Kulikov, and Ivan Mihajlin: Approximating Shortest Superstring Problem Using de Bruijn Graphs
- 15:45-16:10: Jiong Guo, Danny Hermelin, and Christian Komusiewicz: Local Search for String Problems: Brute Force Is Essentially Optimal
June 18 (Tuesday)
- Special Session on the 40th Anniversary of the Suffix Tree:
- TBA
- Text Indexing (chair: Alejandro López-Ortiz):
- 13:15-13:40: Travis Gagie, Wing-Kai Hon, and Tsung-Han Ku: New Algorithms for Position Heaps
- 13:40-14:05: Felipe A. Louza, Guilherme P. Telles, and Cristina Dutra De Aguiar Ciferri: External Memory Generalized Suffix and LCP Arrays Construction
- 14:05-14:30: Wing-Kai Hon, Tsung-Han Ku, Rahul Shah, and Sharma V. Thankachan: Space-Efficient Construction Algorithm for the Circular Suffix Tree
- 14:30-14:55: Travis Gagie, Kalle Karhu, Gonzalo Navarro, Simon J. Puglisi, and Jouni Siren: Document Listing on Repetitive Collections
- Invited Talk II:
- 09:00-10:00: Moshe Lewenstein: Orthogonal Range Searching and Text Indexing
- Algorithms on Compressed Texts (chair: Gad M. Landau):
- 10:25-10:50: Philip Bille, Patrick Hagge Cording, and Inge Li Gørtz: Compact q-Gram Profiling of Compressed Strings
- 10:50-11:15: Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda: Efficient Lyndon Factorization of Grammar Compressed Text
- 11:15-11:40: Elad Verbin and Wei Yu: Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings
- 11:40-12:05: Yasuo Tabei, Yoshimasa Takabatake, and Hiroshi Sakamoto: A Succinct Grammar Compression
- Inexact Matching (chair: Simon J. Puglisi):
- 13:15-13:40: Gary Benson, Yozen Hernandez, and Joshua Loving: A Bit-Parallel, General Integer-Scoring Sequence Alignment Algorithm
- 13:40-14:05: Ury Matarazzo, Dekel Tsur, and Michal Ziv-Ukelson: Efficient All Path Score Computations on Grid Graphs
- 14:05-14:30: Henning Fernau and Markus L. Schmid: Pattern Matching with Variables: A Multivariate Complexity Analysis