Programme
-
Select timezone:
- Venue time
- My local time
Monday, June 26, 2023
08:50 - 09:00 | Opening remarks |
Keynote Talk 1 | |
09:00 - 10:00 | Load Balancing for Distributed Storage Codes with Dynamically Changing File Popularities |
10:00 - 10:20 | Break |
Session 1 | |
10:20 - 10:45 | Suffix-Prefix Queries on a Dictionary |
10:45 - 11:10 | Compressed Indexing for Consecutive Occurrences |
11:10 - 11:35 | Sliding Window String Indexing in Streams |
11:35 - 12:00 | PalFM-index: FM-index for Palindrome Pattern Matching |
12:00 - 13:30 | Lunch |
Highlight Talk 1 | |
13:30 - 14:00 | Separating words and trace reconstruction |
Session 2 | |
14:00 - 14:25 | Comparing Elastic-Degenerate Strings: Algorithms, Lower Bounds, and Applications |
14:25 - 14:50 | Faster Prefix-Sorting Algorithms for Deterministic Finite Automata |
14:50 - 15:20 | Break |
Session 3 | |
15:20 - 15:45 | Order-Preserving Squares in Strings |
15:45 - 16:10 | Linear Time Computation of Cyclic Roots and Cyclic Covers of a String |
16:10 - 16:35 | Parameterized Algorithms for String Matching to DAGs: Funnels and Beyond |
16:35 - 17:00 | On Distances between Words with Parameters |
17:00 - 17:20 | Break |
17:20 - 17:50 | Business meeting |
Tuesday, June 27, 2023
Keynote Talk 2 | |
09:00 - 10:00 | TBA |
10:00 - 10:20 | Break |
Session 4 | |
10:20 - 10:45 | Computing MEMs on Repetitive Text Collections |
10:45 - 11:10 | MONI can find k-MEMs |
11:10 - 11:35 | Encoding Hard String Problems with Answer Set Programming |
11:35 - 12:00 | From Bit-Parallelism to Quantum String Matching for Labelled Graphs |
12:00 - 13:30 | Lunch |
Highlight Talk 2 | |
13:30 - 14:00 | Approximating Dynamic Time Warping Distance Between Run-Length Encoded Strings |
Session 5 | |
14:00 - 14:25 | Approximation Algorithms for the Longest Run Subsequence Problem |
14:25 - 14:50 | String Factorization via Prefix Free Families |
15:00 | Excursion and conference dinner |
Wednesday, June 28, 2023
Keynote Talk 3 | |
09:00 - 10:00 | TBA |
10:00 - 10:20 | Break |
Session 6 | |
10:20 - 10:45 | MUL-Tree Pruning for Consistency and Compatibility |
10:45 - 11:10 | On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem |
11:10 - 11:35 | Faster algorithms for computing the hairpin completion distance and minimum ancestor |
11:35 - 12:00 | Optimal Heaviest Induced Ancestors |
12:00 - 13:30 | Lunch |
Session 7 | |
13:30 - 13:55 | Merging Sorted Lists of Similar Strings |
13:55 - 14:20 | Improving the Sensitivity of MinHash Through Hash-Value Analysis |
14:20 - 14:45 | Trie-Compressed Adaptive Set Intersection |
14:45 - 15:15 | Break |
Session 8 | |
15:15 - 15:40 | On the impact of morphisms on BWT-runs |
15:40 - 16:05 | L-systems for measuring repetitiveness |
16:05 - 16:30 | Optimal LZ-End Parsing is Hard |
16:30 - 16:40 | Closing remarks |